/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/popl20-more/sum-fun.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:18:14,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:18:14,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:18:14,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:18:14,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:18:14,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:18:14,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:18:14,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:18:14,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:18:14,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:18:14,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:18:14,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:18:14,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:18:14,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:18:14,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:18:14,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:18:14,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:18:14,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:18:14,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:18:14,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:18:14,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:18:14,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:18:14,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:18:14,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:18:14,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:18:14,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:18:14,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:18:14,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:18:14,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:18:14,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:18:14,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:18:14,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:18:14,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:18:14,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:18:14,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:18:14,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:18:14,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:18:14,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:18:14,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:18:14,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:18:14,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:18:14,427 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 22:18:14,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:18:14,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:18:14,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:18:14,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:18:14,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:18:14,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:18:14,456 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:18:14,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:18:14,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:18:14,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:18:14,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:18:14,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:18:14,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:18:14,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:18:14,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:18:14,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:18:14,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:18:14,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:18:14,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:18:14,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:18:14,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:18:14,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:18:14,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:18:14,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:18:14,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:18:14,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:18:14,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:18:14,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:18:14,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:18:14,459 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:18:14,459 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:18:14,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:18:14,461 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 22:18:14,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:18:14,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:18:14,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:18:14,692 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:18:14,695 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:18:14,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-fun.wvr.bpl [2022-03-15 22:18:14,696 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-fun.wvr.bpl' [2022-03-15 22:18:14,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:18:14,715 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:18:14,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:18:14,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:18:14,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:18:14,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,739 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:18:14,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:18:14,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:18:14,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:18:14,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:18:14,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:18:14,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:18:14,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:18:14,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:18:14,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/1) ... [2022-03-15 22:18:14,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:18:14,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:14,780 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 22:18:14,804 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 22:18:14,821 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:18:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:18:14,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:18:14,822 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:18:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:18:14,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:18:14,822 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:18:14,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:18:14,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:18:14,823 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:18:14,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:18:14,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:18:14,824 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 22:18:14,869 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:18:14,871 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:18:15,001 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:18:15,013 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:18:15,013 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:18:15,019 INFO L202 PluginConnector]: Adding new model sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:18:15 BoogieIcfgContainer [2022-03-15 22:18:15,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:18:15,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:18:15,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:18:15,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:18:15,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:18:14" (1/2) ... [2022-03-15 22:18:15,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f584057 and model type sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:18:15, skipping insertion in model container [2022-03-15 22:18:15,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:18:15" (2/2) ... [2022-03-15 22:18:15,032 INFO L111 eAbstractionObserver]: Analyzing ICFG sum-fun.wvr.bpl [2022-03-15 22:18:15,035 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:18:15,036 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:18:15,036 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:18:15,036 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:18:15,065 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:18:15,112 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:18:15,117 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 22:18:15,118 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:18:15,127 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:18:15,137 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:18:15,139 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:18:15,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:18:15,181 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:18:15,181 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:18:15,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 22:18:15,185 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:18:15,513 INFO L131 LiptonReduction]: Checked pairs total: 116 [2022-03-15 22:18:15,513 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:18:15,524 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:18:15,536 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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 22:18:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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 22:18:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:18:15,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:15,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:15,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash -580571257, now seen corresponding path program 1 times [2022-03-15 22:18:15,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:15,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541207670] [2022-03-15 22:18:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:15,695 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 22:18:15,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:15,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541207670] [2022-03-15 22:18:15,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541207670] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:18:15,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:18:15,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:18:15,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264404349] [2022-03-15 22:18:15,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:15,702 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:15,725 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:18:15,726 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:15,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [90#(< i N)] [2022-03-15 22:18:15,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:18:15,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:18:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:18:15,887 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 22:18:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:15,922 INFO L93 Difference]: Finished difference Result 31 states and 80 transitions. [2022-03-15 22:18:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:18:15,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 22:18:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:15,930 INFO L225 Difference]: With dead ends: 31 [2022-03-15 22:18:15,930 INFO L226 Difference]: Without dead ends: 31 [2022-03-15 22:18:15,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:18:15,933 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:15,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:18:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-15 22:18:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-03-15 22:18:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 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 22:18:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:18:15,963 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 11 [2022-03-15 22:18:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:15,963 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:18:15,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 22:18:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:18:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:18:15,964 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:15,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:15,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:18:15,965 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:15,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:15,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1068507127, now seen corresponding path program 1 times [2022-03-15 22:18:15,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:15,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609160529] [2022-03-15 22:18:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:15,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:15,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609160529] [2022-03-15 22:18:15,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609160529] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:18:15,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:18:15,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:18:15,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812341507] [2022-03-15 22:18:15,997 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:15,999 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:16,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:18:16,004 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:16,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:18:16,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:18:16,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:16,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:18:16,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:18:16,249 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 22:18:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:16,285 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 22:18:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:18:16,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 12 [2022-03-15 22:18:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:16,287 INFO L225 Difference]: With dead ends: 40 [2022-03-15 22:18:16,287 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 22:18:16,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:18:16,289 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:16,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:18:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 22:18:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 22:18:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 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 22:18:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:18:16,296 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:18:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:16,297 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:18:16,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 22:18:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:18:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:18:16,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:16,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:16,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:18:16,298 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash 282949368, now seen corresponding path program 1 times [2022-03-15 22:18:16,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:16,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153348177] [2022-03-15 22:18:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:16,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:16,582 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 22:18:16,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:16,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153348177] [2022-03-15 22:18:16,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153348177] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:16,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958195321] [2022-03-15 22:18:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:16,587 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 22:18:16,605 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 22:18:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:16,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:18:16,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:16,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 22:18:16,883 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 22:18:16,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:16,929 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:18:16,930 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 17 [2022-03-15 22:18:17,030 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 22:18:17,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958195321] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:17,032 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:17,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 22:18:17,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1668708664] [2022-03-15 22:18:17,033 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:17,034 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:17,040 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:18:17,040 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:18,010 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [395#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0)) (or (= sum3 0) (< j M))), 391#(and (or (= sum2 0) (< j M)) (or (< j M) (<= sum3 sum1)) (or (< j M) (<= sum1 sum3))), 394#(and (or (< j M) (<= (select A i) sum3)) (or (= sum2 0) (< j M)) (or (<= sum3 (select A i)) (< j M)) (or (< j M) (= sum1 0))), 392#(and (= sum2 0) (<= (+ sum3 (select A k)) sum1) (<= sum1 (+ sum3 (select A k)))), 393#(and (or (= sum2 0) (< j M)) (or (< j M) (<= (+ sum3 (select A k)) sum1)) (or (< j M) (<= sum1 (+ sum3 (select A k)))))] [2022-03-15 22:18:18,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:18:18,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:18,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:18:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:18:18,012 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:18,193 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:18:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:18:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:18:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:18,197 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:18:18,197 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:18:18,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:18:18,198 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:18,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:18:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:18:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:18:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.8656716417910446) internal successors, (192), 67 states have internal predecessors, (192), 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 22:18:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:18:18,211 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:18:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:18,211 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:18:18,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:18:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:18:18,212 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:18,212 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:18,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 22:18:18,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:18,413 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash 134365460, now seen corresponding path program 2 times [2022-03-15 22:18:18,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:18,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856181324] [2022-03-15 22:18:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:18,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:18,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856181324] [2022-03-15 22:18:18,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856181324] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:18,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733437299] [2022-03-15 22:18:18,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:18,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:18,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:18,476 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 22:18:18,482 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 22:18:18,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:18,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:18,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:18:18,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:18,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:18,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733437299] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:18,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:18,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:18:18,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2027939078] [2022-03-15 22:18:18,605 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:18,607 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:18,612 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:18:18,612 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:19,205 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [695#(< j M), 699#(or (< j M) (< k N)), 688#(or (<= k i) (< j M)), 698#(or (<= N i) (< k N)), 700#(or (<= N i) (< j M) (< k N)), 697#(< k N), 706#(or (< j M) (<= k (+ i 1))), 702#(or (<= N i) (<= N k) (< (+ k 1) N)), 701#(or (<= N k) (< (+ k 1) N)), 705#(or (<= N (+ i 1)) (< j M)), 704#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 696#(or (<= N i) (< j M)), 703#(or (< j M) (<= N k) (< (+ k 1) N))] [2022-03-15 22:18:19,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:18:19,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:18:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:18:19,207 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 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 22:18:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:20,242 INFO L93 Difference]: Finished difference Result 175 states and 510 transitions. [2022-03-15 22:18:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:18:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 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 14 [2022-03-15 22:18:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:20,245 INFO L225 Difference]: With dead ends: 175 [2022-03-15 22:18:20,245 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 22:18:20,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=800, Invalid=2622, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:18:20,247 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:20,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:18:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 22:18:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 91. [2022-03-15 22:18:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 3.2555555555555555) internal successors, (293), 90 states have internal predecessors, (293), 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 22:18:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 293 transitions. [2022-03-15 22:18:20,259 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 293 transitions. Word has length 14 [2022-03-15 22:18:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:20,259 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 293 transitions. [2022-03-15 22:18:20,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 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 22:18:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 293 transitions. [2022-03-15 22:18:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:18:20,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:20,261 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:20,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 22:18:20,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 22:18:20,476 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash -771572247, now seen corresponding path program 3 times [2022-03-15 22:18:20,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:20,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057493500] [2022-03-15 22:18:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:20,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:20,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057493500] [2022-03-15 22:18:20,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057493500] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:20,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757499598] [2022-03-15 22:18:20,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:20,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:20,543 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 22:18:20,567 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 22:18:20,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:18:20,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:20,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:18:20,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:20,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:20,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757499598] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:20,700 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:20,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:18:20,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657475693] [2022-03-15 22:18:20,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:20,702 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:20,707 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:18:20,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:21,215 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1229#(< k N), 1232#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1231#(or (<= N k) (< (+ k 1) N)), 1230#(or (< k N) (< i N)), 1234#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 1233#(or (<= N k) (< (+ k 1) N) (< i N))] [2022-03-15 22:18:21,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:18:21,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:21,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:18:21,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:18:21,217 INFO L87 Difference]: Start difference. First operand 91 states and 293 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 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 22:18:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:21,717 INFO L93 Difference]: Finished difference Result 240 states and 732 transitions. [2022-03-15 22:18:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:18:21,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 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 22:18:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:21,719 INFO L225 Difference]: With dead ends: 240 [2022-03-15 22:18:21,719 INFO L226 Difference]: Without dead ends: 240 [2022-03-15 22:18:21,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:18:21,720 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:21,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:18:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-03-15 22:18:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 170. [2022-03-15 22:18:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.4319526627218937) internal successors, (580), 169 states have internal predecessors, (580), 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 22:18:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 580 transitions. [2022-03-15 22:18:21,736 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 580 transitions. Word has length 14 [2022-03-15 22:18:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:21,736 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 580 transitions. [2022-03-15 22:18:21,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 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 22:18:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 580 transitions. [2022-03-15 22:18:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:18:21,738 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:21,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:21,770 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 22:18:21,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:21,965 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:21,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1294994650, now seen corresponding path program 1 times [2022-03-15 22:18:21,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:21,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270104884] [2022-03-15 22:18:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:22,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:22,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270104884] [2022-03-15 22:18:22,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270104884] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:22,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713673527] [2022-03-15 22:18:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:22,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:22,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:22,021 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 22:18:22,033 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 22:18:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:22,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:18:22,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:22,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:18:22,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713673527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:22,149 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:22,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:18:22,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1676957598] [2022-03-15 22:18:22,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:22,151 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:22,157 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 22:18:22,157 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:22,623 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1938#(or (< (+ j 1) M) (<= M j)), 1940#(or (< j M) (<= (+ 2 i) N)), 1939#(or (< (+ j 1) M) (< i N) (<= M j)), 1941#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 1936#(< j M), 1937#(or (< j M) (< i N))] [2022-03-15 22:18:22,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:18:22,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:18:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:18:22,624 INFO L87 Difference]: Start difference. First operand 170 states and 580 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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 22:18:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:22,779 INFO L93 Difference]: Finished difference Result 256 states and 873 transitions. [2022-03-15 22:18:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:18:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:18:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:22,782 INFO L225 Difference]: With dead ends: 256 [2022-03-15 22:18:22,782 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 22:18:22,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:18:22,783 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:22,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:18:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 22:18:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2022-03-15 22:18:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 3.444976076555024) internal successors, (720), 209 states have internal predecessors, (720), 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 22:18:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 720 transitions. [2022-03-15 22:18:22,795 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 720 transitions. Word has length 14 [2022-03-15 22:18:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:22,795 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 720 transitions. [2022-03-15 22:18:22,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 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 22:18:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 720 transitions. [2022-03-15 22:18:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:18:22,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:22,797 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:22,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:22,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:22,998 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1803933763, now seen corresponding path program 4 times [2022-03-15 22:18:23,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:23,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992227975] [2022-03-15 22:18:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:23,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:23,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992227975] [2022-03-15 22:18:23,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992227975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:23,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556828245] [2022-03-15 22:18:23,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:18:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:23,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:23,208 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 22:18:23,213 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 22:18:23,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:18:23,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:23,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:18:23,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:23,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-03-15 22:18:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:23,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:23,574 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:18:23,575 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 22 treesize of output 47 [2022-03-15 22:18:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:23,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556828245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:23,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:23,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:18:23,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183969896] [2022-03-15 22:18:23,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:23,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:23,726 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:18:23,727 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:27,052 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2744#(and (or (= sum2 0) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k)))) (or (not (< (+ k 1) N)) (< j M) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N))), 2740#(and (or (not (< k N)) (<= (+ sum3 (select A k)) (+ (select A i) sum1)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= sum2 0) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ (select A i) sum1) (+ sum3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N))), 2749#(and (or (< j M) (<= (select A i) sum3)) (or (= sum2 0) (< j M)) (or (<= sum3 (select A i)) (< j M)) (or (< j M) (= sum1 0)) (or (<= (+ i 1) k) (< j M))), 2729#(and (or (= sum2 0) (< j M)) (or (< j M) (<= sum3 sum1)) (or (< j M) (<= sum1 sum3))), 2747#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k))) (< i N)) (or (not (< k N)) (< j M) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N) (< i N)) (or (not (< k N)) (= sum2 0) (< j M) (< (+ k 1) N) (< i N))), 2750#(and (or (not (< (+ k 1) N)) (< j M) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k))) (< i N)) (or (= sum2 0) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (< i N))), 2741#(and (or (= sum2 0) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum3 (select A k))) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) sum3 (select A k)) (+ (select A i) sum1)))), 2735#(and (or (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k)))) (or (= sum2 0) (not (< (+ k 1) N)) (< (+ 2 k) N))), 2731#(and (or (< j M) (<= sum3 (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (= sum2 0) (< j M) (<= (+ 2 i) N)) (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) sum1) sum3))), 2742#(and (or (= sum2 0) (< j M) (< k N)) (or (< j M) (<= sum3 sum1) (< k N)) (or (< j M) (< k N) (<= sum1 sum3))), 2748#(and (or (not (< k N)) (<= (+ (select A i) sum1) (+ sum3 (select A k))) (< j M) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= (+ sum3 (select A k)) (+ (select A i) sum1)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= sum2 0) (< j M) (< (+ k 1) N) (<= (+ 2 i) N))), 2733#(and (or (< k N) (<= sum1 sum3)) (or (= sum2 0) (< k N)) (or (<= sum3 sum1) (< k N))), 2739#(and (or (<= sum3 (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N)) (or (< k N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) sum3)) (or (= sum2 0) (< k N) (<= (+ 2 i) N))), 2737#(and (or (not (< k N)) (= sum2 0) (< (+ k 1) N) (< i N)) (or (not (< k N)) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k))) (< i N))), 2746#(and (or (= sum2 0) (< j M) (< k N) (<= (+ 2 i) N)) (or (< j M) (< k N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) sum3)) (or (< j M) (<= sum3 (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N))), 2738#(and (or (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N) (< i N)) (or (= sum2 0) (not (< (+ k 1) N)) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k))) (< i N))), 2734#(and (or (not (< k N)) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k)))) (or (not (< k N)) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N)) (or (not (< k N)) (= sum2 0) (< (+ k 1) N))), 2736#(and (or (< k N) (<= sum1 sum3) (< i N)) (or (= sum2 0) (< k N) (< i N)) (or (<= sum3 sum1) (< k N) (< i N))), 2752#(and (or (< j M) (= k i)) (or (= sum2 0) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= sum1 0)) (or (= sum3 0) (< j M))), 2743#(and (or (not (< k N)) (< j M) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k)))) (or (not (< k N)) (= sum2 0) (< j M) (< (+ k 1) N))), 2745#(and (or (= sum2 0) (< j M) (< k N) (< i N)) (or (< j M) (< k N) (<= sum1 sum3) (< i N)) (or (< j M) (<= sum3 sum1) (< k N) (< i N))), 2730#(and (or (= sum2 0) (< j M) (< i N)) (or (< j M) (<= sum1 sum3) (< i N)) (or (< j M) (<= sum3 sum1) (< i N))), 2751#(and (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) sum3 (select A k)) (+ (select A i) sum1))) (or (= sum2 0) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum3 (select A k))) (< (+ 2 k) N) (<= (+ 2 i) N))), 2732#(and (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) (select A (+ (- 1) N))) sum3)) (or (<= (+ 3 i) N) (= sum2 0) (< j M)) (or (< (+ 2 i) N) (< j M) (<= sum3 (+ (select A i) (select A (+ (- 1) N))))) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) sum3)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= sum3 (+ (select A i) sum1 (select A (+ i 1))))))] [2022-03-15 22:18:27,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:18:27,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:18:27,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1540, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:18:27,054 INFO L87 Difference]: Start difference. First operand 210 states and 720 transitions. Second operand has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 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 22:18:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:35,797 INFO L93 Difference]: Finished difference Result 432 states and 1352 transitions. [2022-03-15 22:18:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 22:18:35,797 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 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 22:18:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:35,800 INFO L225 Difference]: With dead ends: 432 [2022-03-15 22:18:35,800 INFO L226 Difference]: Without dead ends: 417 [2022-03-15 22:18:35,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2022, Invalid=10188, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 22:18:35,804 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:35,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:18:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-03-15 22:18:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 250. [2022-03-15 22:18:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.5421686746987953) internal successors, (882), 249 states have internal predecessors, (882), 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 22:18:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 882 transitions. [2022-03-15 22:18:35,824 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 882 transitions. Word has length 15 [2022-03-15 22:18:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:35,825 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 882 transitions. [2022-03-15 22:18:35,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 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 22:18:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 882 transitions. [2022-03-15 22:18:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:18:35,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:35,829 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:35,851 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 22:18:36,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:36,045 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1005306136, now seen corresponding path program 5 times [2022-03-15 22:18:36,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:36,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490671732] [2022-03-15 22:18:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:36,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:36,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490671732] [2022-03-15 22:18:36,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490671732] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:36,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686604768] [2022-03-15 22:18:36,098 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:18:36,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:36,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:36,099 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 22:18:36,100 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 22:18:36,128 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:18:36,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:36,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:18:36,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:36,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:36,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686604768] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:36,237 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:36,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 22:18:36,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919114482] [2022-03-15 22:18:36,238 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:36,243 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:36,247 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:18:36,247 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:36,663 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3922#(or (<= N k) (< i N)), 3925#(or (<= N i) (< (+ i 1) N) (<= N k)), 3921#(or (<= (+ N 1) k) (< i N)), 3920#(< i N), 3924#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 3923#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:18:36,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:18:36,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:36,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:18:36,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:18:36,664 INFO L87 Difference]: Start difference. First operand 250 states and 882 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 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 22:18:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:37,033 INFO L93 Difference]: Finished difference Result 379 states and 1208 transitions. [2022-03-15 22:18:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:18:37,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:18:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:37,038 INFO L225 Difference]: With dead ends: 379 [2022-03-15 22:18:37,038 INFO L226 Difference]: Without dead ends: 358 [2022-03-15 22:18:37,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:18:37,039 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:37,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:18:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-03-15 22:18:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 248. [2022-03-15 22:18:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 3.48582995951417) internal successors, (861), 247 states have internal predecessors, (861), 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 22:18:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 861 transitions. [2022-03-15 22:18:37,054 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 861 transitions. Word has length 15 [2022-03-15 22:18:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:37,054 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 861 transitions. [2022-03-15 22:18:37,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 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 22:18:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 861 transitions. [2022-03-15 22:18:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:18:37,057 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:37,057 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:37,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:37,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:37,268 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:37,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:37,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1442998130, now seen corresponding path program 2 times [2022-03-15 22:18:37,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:37,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858315142] [2022-03-15 22:18:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:37,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:37,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:37,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858315142] [2022-03-15 22:18:37,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858315142] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:37,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836106932] [2022-03-15 22:18:37,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:18:37,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:37,385 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 22:18:37,396 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 22:18:37,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:18:37,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:37,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:18:37,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:37,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:37,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:37,646 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 24 treesize of output 16 [2022-03-15 22:18:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:37,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:37,814 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:18:37,815 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 21 treesize of output 56 [2022-03-15 22:18:37,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:37,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:37,983 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:18:37,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 47 [2022-03-15 22:18:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:38,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836106932] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:38,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:38,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 22:18:38,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964142002] [2022-03-15 22:18:38,135 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:38,136 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:38,141 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 22:18:38,141 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:41,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [4951#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1)) (< i N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1) (< i N))), 4956#(and (or (< (+ j 1) M) (not (< j M)) (< i N) (<= (+ (select A j) sum3 sum2) sum1)) (or (< (+ j 1) M) (not (< j M)) (< i N) (< sum1 (+ (select A j) sum3 sum2 1)))), 4944#(and (or (< sum1 (+ sum3 sum2 1)) (< k N) (<= (+ i 1) N)) (or (<= (+ sum3 sum2) sum1) (< k N) (<= (+ i 1) N))), 4957#(and (or (< (+ j 1) M) (not (< j M)) (< k N) (< i N) (< sum1 (+ (select A j) sum3 sum2 1))) (or (< (+ j 1) M) (not (< j M)) (< k N) (< i N) (<= (+ (select A j) sum3 sum2) sum1))), 4952#(and (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ sum3 sum2 (select A k)))) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ sum3 sum2 (select A k)) (+ (select A i) sum1)))), 4954#(and (or (< (+ j 1) M) (not (< j M)) (< sum1 (+ (select A j) sum3 sum2 1))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum3 sum2) sum1))), 4953#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ sum3 sum2 (select A k)))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ sum3 sum2 (select A k)) (+ (select A i) sum1)))), 4939#(and (or (< j M) (<= (+ sum3 sum2) sum1)) (or (< j M) (< sum1 (+ sum3 sum2 1)))), 4960#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ (select A j) sum3 sum2))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1)) (<= (+ 2 i) N))), 4961#(and (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ (select A j) sum3 sum2)))), 4945#(and (or (< j M) (< sum1 (+ sum3 sum2 1)) (< k N) (< i N)) (or (< j M) (<= (+ sum3 sum2) sum1) (< k N) (< i N))), 4940#(and (or (< j M) (<= (+ sum3 sum2) sum1) (<= (+ i 1) N)) (or (< j M) (< sum1 (+ sum3 sum2 1)) (<= (+ i 1) N))), 4946#(and (or (<= (+ sum3 sum2) (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N)) (or (<= (+ (select A i) sum1) (+ sum3 sum2)) (< k N) (<= (+ 2 i) N))), 4947#(and (or (< j M) (<= (+ (select A i) sum1) (+ sum3 sum2)) (< k N) (<= (+ 2 i) N)) (or (< j M) (<= (+ sum3 sum2) (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N))), 4963#(and (or (< (+ 2 i) N) (< j M) (<= (+ sum3 sum2) (+ (select A i) (select A (+ (- 1) N))))) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) (select A (+ (- 1) N))) (+ sum3 sum2))) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= (+ sum3 sum2) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum3 sum2)))), 4964#(and (or (<= (+ (select A i) (select A (+ (- 1) N))) (+ (select A j) sum3 sum2)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M))) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1 (select A (+ i 1)))) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) sum3 sum2)) (not (< j M))) (or (< (+ j 1) M) (<= (+ (select A j) sum3 sum2) (+ (select A i) (select A (+ (- 1) N)))) (< (+ 2 i) N) (not (< j M)))), 4955#(and (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ (select A j) sum3 sum2) sum1)) (or (< (+ j 1) M) (not (< j M)) (< k N) (< sum1 (+ (select A j) sum3 sum2 1)))), 4958#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (< sum1 (+ (select A j) sum3 sum2 (select A k) 1))) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A j) sum3 sum2 (select A k)) sum1) (not (< j M)) (< (+ k 1) N))), 4950#(and (or (not (< k N)) (<= (+ i 1) N) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1))) (or (not (< k N)) (<= (+ i 1) N) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1))), 4943#(and (or (< j M) (<= (+ sum3 sum2) sum1) (< k N)) (or (< j M) (< sum1 (+ sum3 sum2 1)) (< k N))), 4962#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) sum1) (+ (select A j) sum3 sum2 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A j) sum3 sum2 (select A k)) (+ (select A i) sum1)))), 4948#(and (or (not (< k N)) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1))) (or (not (< k N)) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1))), 4941#(and (or (< j M) (<= (+ sum3 sum2) (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (< j M) (<= (+ (select A i) sum1) (+ sum3 sum2)) (<= (+ 2 i) N))), 4949#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1))), 4942#(and (or (< sum1 (+ sum3 sum2 1)) (< k N)) (or (<= (+ sum3 sum2) sum1) (< k N))), 4959#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (< sum1 (+ (select A j) sum3 sum2 (select A k) 1)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A j) sum3 sum2 (select A k)) sum1) (not (< j M)) (< (+ k 1) N) (< i N)))] [2022-03-15 22:18:41,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:18:41,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:41,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:18:41,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1650, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:18:41,174 INFO L87 Difference]: Start difference. First operand 248 states and 861 transitions. Second operand has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 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 22:18:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:56,636 INFO L93 Difference]: Finished difference Result 1049 states and 2833 transitions. [2022-03-15 22:18:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-03-15 22:18:56,636 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 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 22:18:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:56,641 INFO L225 Difference]: With dead ends: 1049 [2022-03-15 22:18:56,641 INFO L226 Difference]: Without dead ends: 1003 [2022-03-15 22:18:56,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11590 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=5463, Invalid=28209, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 22:18:56,649 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 609 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:56,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [609 Valid, 0 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:18:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-03-15 22:18:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 264. [2022-03-15 22:18:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 3.494296577946768) internal successors, (919), 263 states have internal predecessors, (919), 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 22:18:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 919 transitions. [2022-03-15 22:18:56,665 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 919 transitions. Word has length 15 [2022-03-15 22:18:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:56,665 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 919 transitions. [2022-03-15 22:18:56,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 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 22:18:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 919 transitions. [2022-03-15 22:18:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:18:56,666 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:56,667 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:56,686 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 22:18:56,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:56,880 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1848560448, now seen corresponding path program 3 times [2022-03-15 22:18:56,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:56,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827886021] [2022-03-15 22:18:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:56,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:18:56,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:56,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827886021] [2022-03-15 22:18:56,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827886021] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:56,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348589666] [2022-03-15 22:18:56,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:56,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:56,916 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 22:18:56,946 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 22:18:56,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:18:56,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:56,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:18:56,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:18:57,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:18:57,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348589666] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:57,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:57,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:18:57,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729055302] [2022-03-15 22:18:57,057 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:57,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:57,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2022-03-15 22:18:57,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:57,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6915#(< i N), 6916#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:18:57,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:18:57,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:57,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:18:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 22:18:57,418 INFO L87 Difference]: Start difference. First operand 264 states and 919 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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 22:18:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:57,569 INFO L93 Difference]: Finished difference Result 396 states and 1288 transitions. [2022-03-15 22:18:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:18:57,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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 15 [2022-03-15 22:18:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:57,571 INFO L225 Difference]: With dead ends: 396 [2022-03-15 22:18:57,571 INFO L226 Difference]: Without dead ends: 388 [2022-03-15 22:18:57,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:18:57,572 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:57,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:18:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-03-15 22:18:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 245. [2022-03-15 22:18:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 3.4959016393442623) internal successors, (853), 244 states have internal predecessors, (853), 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 22:18:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 853 transitions. [2022-03-15 22:18:57,581 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 853 transitions. Word has length 15 [2022-03-15 22:18:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:57,581 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 853 transitions. [2022-03-15 22:18:57,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 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 22:18:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 853 transitions. [2022-03-15 22:18:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:18:57,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:57,582 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:57,607 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 22:18:57,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 22:18:57,783 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 40241449, now seen corresponding path program 6 times [2022-03-15 22:18:57,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:57,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269953124] [2022-03-15 22:18:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:57,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:57,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:57,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269953124] [2022-03-15 22:18:57,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269953124] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:57,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111737570] [2022-03-15 22:18:57,847 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:18:57,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:57,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:57,849 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 22:18:57,855 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 22:18:57,876 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:18:57,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:57,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:18:57,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:57,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:18:57,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111737570] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:57,958 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:57,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:18:57,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1351146423] [2022-03-15 22:18:57,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:57,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:57,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:18:57,964 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:18:58,838 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [7935#(or (< j M) (<= N k) (< (+ k 1) N)), 7924#(or (<= N (+ k 1)) (< (+ 2 k) N)), 7923#(or (<= N k) (< (+ k 1) N)), 7942#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 7940#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 7915#(or (<= k i) (< j M)), 7938#(or (<= N (+ i 1)) (< j M) (< k N)), 7932#(or (<= N i) (< j M)), 7939#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 7944#(or (< j M) (<= k (+ 2 i))), 7926#(or (<= N i) (<= N k) (< (+ k 1) N)), 7936#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 7943#(or (<= N (+ 2 i)) (< j M)), 7925#(or (<= N i) (< k N)), 7933#(or (< j M) (< k N)), 7934#(or (<= N i) (< j M) (< k N)), 7929#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 7941#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 7922#(< k N), 7931#(< j M), 7927#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 7945#(or (< j M) (<= k (+ i 1))), 7930#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 7928#(or (<= N (+ i 1)) (< k N)), 7937#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:18:58,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:18:58,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:18:58,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:18:58,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:18:58,839 INFO L87 Difference]: Start difference. First operand 245 states and 853 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 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 22:19:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:00,819 INFO L93 Difference]: Finished difference Result 598 states and 1975 transitions. [2022-03-15 22:19:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:19:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 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 22:19:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:00,823 INFO L225 Difference]: With dead ends: 598 [2022-03-15 22:19:00,823 INFO L226 Difference]: Without dead ends: 591 [2022-03-15 22:19:00,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3305 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2726, Invalid=9264, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:19:00,826 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 318 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:00,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 0 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-03-15 22:19:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 317. [2022-03-15 22:19:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.6740506329113924) internal successors, (1161), 316 states have internal predecessors, (1161), 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 22:19:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1161 transitions. [2022-03-15 22:19:00,840 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1161 transitions. Word has length 16 [2022-03-15 22:19:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:00,840 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1161 transitions. [2022-03-15 22:19:00,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 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 22:19:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1161 transitions. [2022-03-15 22:19:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:00,842 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:00,842 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:00,864 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 22:19:01,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:01,065 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:01,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2020943604, now seen corresponding path program 7 times [2022-03-15 22:19:01,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:01,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739819565] [2022-03-15 22:19:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:01,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:01,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:01,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739819565] [2022-03-15 22:19:01,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739819565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:01,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529880934] [2022-03-15 22:19:01,114 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:19:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:01,115 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 22:19:01,127 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 22:19:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:01,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:19:01,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:01,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:01,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529880934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:01,260 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:01,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:19:01,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121083349] [2022-03-15 22:19:01,260 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:01,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:01,265 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:19:01,265 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:01,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [9433#(< k N), 9437#(or (<= N (+ k 1)) (< (+ 2 k) N)), 9442#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)), 9440#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 9443#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 9436#(or (< k N) (<= (+ 2 i) N)), 9438#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 9441#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 9435#(or (< k N) (< i N)), 9439#(or (<= N k) (< (+ k 1) N) (< i N)), 9434#(or (<= N k) (< (+ k 1) N)), 9444#(or (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N))] [2022-03-15 22:19:01,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:19:01,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:19:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:19:01,963 INFO L87 Difference]: Start difference. First operand 317 states and 1161 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 22:19:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:02,736 INFO L93 Difference]: Finished difference Result 697 states and 2367 transitions. [2022-03-15 22:19:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:19:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 22:19:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:02,741 INFO L225 Difference]: With dead ends: 697 [2022-03-15 22:19:02,741 INFO L226 Difference]: Without dead ends: 697 [2022-03-15 22:19:02,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=850, Invalid=2572, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:19:02,742 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:02,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:19:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-03-15 22:19:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 439. [2022-03-15 22:19:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.7100456621004567) internal successors, (1625), 438 states have internal predecessors, (1625), 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 22:19:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1625 transitions. [2022-03-15 22:19:02,757 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1625 transitions. Word has length 16 [2022-03-15 22:19:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:02,757 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 1625 transitions. [2022-03-15 22:19:02,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 22:19:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1625 transitions. [2022-03-15 22:19:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:02,759 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:02,759 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:02,781 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 22:19:02,975 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,SelfDestructingSolverStorable11 [2022-03-15 22:19:02,976 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -578126427, now seen corresponding path program 4 times [2022-03-15 22:19:02,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:02,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133338186] [2022-03-15 22:19:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:03,019 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 22:19:03,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:03,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133338186] [2022-03-15 22:19:03,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133338186] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:03,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774114455] [2022-03-15 22:19:03,019 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:19:03,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:03,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:03,021 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 22:19:03,030 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 22:19:03,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:19:03,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:03,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:19:03,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:03,097 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 22:19:03,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:03,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774114455] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:03,139 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:03,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:19:03,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [916801491] [2022-03-15 22:19:03,140 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:03,140 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:03,146 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 22:19:03,146 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:04,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [11200#(or (< (+ j 1) M) (< i N) (<= M j)), 11184#(< k N), 11204#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (< i N)), 11219#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)), 11210#(or (< k N) (<= (+ 2 i) N)), 11220#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= M j)), 11187#(or (< (+ j 1) M) (<= M j)), 11196#(or (< j M) (< i N)), 11202#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (< i N) (<= M j)), 11189#(or (<= N k) (< (+ k 1) N)), 11185#(< j M), 11195#(or (< k N) (< i N)), 11208#(or (<= (+ 3 i) N) (< j M)), 11217#(or (< (+ j 1) M) (<= (+ 2 i) k) (<= M j)), 11186#(or (< j M) (< k N)), 11211#(or (< j M) (< k N) (<= (+ 2 i) N)), 11218#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)), 11197#(or (< j M) (< k N) (< i N)), 11194#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 11193#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 11190#(or (< j M) (<= N k) (< (+ k 1) N)), 11203#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 11199#(or (< j M) (<= N k) (< (+ k 1) N) (< i N)), 11216#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N) (<= M j)), 11205#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (< i N) (<= M j)), 11213#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11188#(or (< (+ j 1) M) (< k N) (<= M j)), 11215#(or (< j M) (<= (+ 2 i) k)), 11198#(or (<= N k) (< (+ k 1) N) (< i N)), 11214#(or (< j M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11212#(or (< (+ j 1) M) (< k N) (<= (+ 2 i) N) (<= M j)), 11191#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 11206#(or (< j M) (<= (+ 2 i) N)), 11209#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 11192#(or (<= N (+ k 1)) (< (+ 2 k) N)), 11207#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 11201#(or (< (+ j 1) M) (< k N) (< i N) (<= M j))] [2022-03-15 22:19:04,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:19:04,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:19:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:19:04,612 INFO L87 Difference]: Start difference. First operand 439 states and 1625 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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 22:19:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:09,040 INFO L93 Difference]: Finished difference Result 973 states and 3458 transitions. [2022-03-15 22:19:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 22:19:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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 22:19:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:09,046 INFO L225 Difference]: With dead ends: 973 [2022-03-15 22:19:09,047 INFO L226 Difference]: Without dead ends: 958 [2022-03-15 22:19:09,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14166 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7971, Invalid=32229, Unknown=0, NotChecked=0, Total=40200 [2022-03-15 22:19:09,052 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 642 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:09,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 0 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:19:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-03-15 22:19:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 576. [2022-03-15 22:19:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 3.7704347826086955) internal successors, (2168), 575 states have internal predecessors, (2168), 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 22:19:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 2168 transitions. [2022-03-15 22:19:09,084 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 2168 transitions. Word has length 16 [2022-03-15 22:19:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:09,085 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 2168 transitions. [2022-03-15 22:19:09,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 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 22:19:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 2168 transitions. [2022-03-15 22:19:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:09,087 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:09,087 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:09,111 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 22:19:09,300 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,SelfDestructingSolverStorable12 [2022-03-15 22:19:09,300 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:09,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1676567846, now seen corresponding path program 5 times [2022-03-15 22:19:09,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:09,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302491091] [2022-03-15 22:19:09,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:09,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:09,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:09,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302491091] [2022-03-15 22:19:09,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302491091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:09,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478684401] [2022-03-15 22:19:09,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:19:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:09,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:09,356 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 22:19:09,356 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 22:19:09,377 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:19:09,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:09,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:19:09,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:09,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:09,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478684401] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:09,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:09,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 22:19:09,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2046988063] [2022-03-15 22:19:09,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:09,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:09,524 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 22:19:09,525 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:10,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [13765#(or (< j M) (< k N)), 13782#(or (< (+ j 1) M) (< k N) (<= M j)), 13768#(or (<= N i) (<= N k) (< (+ k 1) N)), 13764#(or (<= N i) (< j M)), 13787#(or (<= N (+ i 1)) (< (+ j 1) M) (< k N) (<= M j)), 13776#(or (<= N (+ 2 i)) (< k N)), 13778#(or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N)), 13761#(< k N), 13762#(or (<= N i) (< k N)), 13780#(or (< (+ j 1) M) (<= M j)), 13784#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 13779#(or (<= (+ N j) (+ 2 M i)) (<= N k) (< (+ k 1) N)), 13763#(< j M), 13766#(or (<= N i) (< j M) (< k N)), 13775#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 13770#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 13781#(or (< (+ j 1) M) (<= N i) (<= M j)), 13774#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 13772#(or (<= N (+ i 1)) (< k N)), 13788#(or (<= N (+ i 1)) (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 13777#(or (<= (+ N j) (+ 2 M i)) (< k N)), 13767#(or (<= N k) (< (+ k 1) N)), 13783#(or (< (+ j 1) M) (<= N i) (< k N) (<= M j)), 13771#(or (<= N (+ i 1)) (< j M)), 13785#(or (< (+ j 1) M) (<= N i) (<= N k) (< (+ k 1) N) (<= M j)), 13773#(or (<= N (+ i 1)) (< j M) (< k N)), 13786#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 13769#(or (< j M) (<= N k) (< (+ k 1) N))] [2022-03-15 22:19:10,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:19:10,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:10,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:19:10,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1712, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:19:10,671 INFO L87 Difference]: Start difference. First operand 576 states and 2168 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 states have internal predecessors, (116), 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 22:19:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:13,248 INFO L93 Difference]: Finished difference Result 934 states and 3191 transitions. [2022-03-15 22:19:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 22:19:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 states have internal predecessors, (116), 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 22:19:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:13,252 INFO L225 Difference]: With dead ends: 934 [2022-03-15 22:19:13,252 INFO L226 Difference]: Without dead ends: 929 [2022-03-15 22:19:13,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5036 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3474, Invalid=13818, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 22:19:13,254 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:13,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:19:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-03-15 22:19:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 609. [2022-03-15 22:19:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 3.7878289473684212) internal successors, (2303), 608 states have internal predecessors, (2303), 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 22:19:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 2303 transitions. [2022-03-15 22:19:13,273 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 2303 transitions. Word has length 16 [2022-03-15 22:19:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:13,273 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 2303 transitions. [2022-03-15 22:19:13,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 states have internal predecessors, (116), 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 22:19:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 2303 transitions. [2022-03-15 22:19:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:13,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:13,275 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:13,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:13,497 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,SelfDestructingSolverStorable13 [2022-03-15 22:19:13,498 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -975824784, now seen corresponding path program 6 times [2022-03-15 22:19:13,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:13,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982153148] [2022-03-15 22:19:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:19:13,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:13,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982153148] [2022-03-15 22:19:13,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982153148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:13,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345033347] [2022-03-15 22:19:13,537 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:19:13,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:13,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:13,540 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 22:19:13,557 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 22:19:13,570 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:19:13,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:13,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:19:13,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:19:13,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:19:13,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345033347] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:13,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:13,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:19:13,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675158032] [2022-03-15 22:19:13,681 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:13,682 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:13,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 22:19:13,688 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:14,478 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [16217#(or (< (+ j 1) M) (<= M j)), 16223#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 16224#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 16220#(or (< (+ j 1) M) (< i N) (<= M j)), 16222#(or (< j M) (<= (+ 2 i) N)), 16219#(or (< j M) (< i N)), 16218#(or (< (+ 2 j) M) (<= M (+ j 1))), 16221#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N)), 16216#(< j M)] [2022-03-15 22:19:14,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:19:14,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:19:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:19:14,480 INFO L87 Difference]: Start difference. First operand 609 states and 2303 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 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 22:19:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:14,906 INFO L93 Difference]: Finished difference Result 1081 states and 4109 transitions. [2022-03-15 22:19:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:19:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 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 22:19:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:14,911 INFO L225 Difference]: With dead ends: 1081 [2022-03-15 22:19:14,911 INFO L226 Difference]: Without dead ends: 1081 [2022-03-15 22:19:14,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=963, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:19:14,912 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:14,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:19:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-03-15 22:19:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 727. [2022-03-15 22:19:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 3.84297520661157) internal successors, (2790), 726 states have internal predecessors, (2790), 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 22:19:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2790 transitions. [2022-03-15 22:19:14,933 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2790 transitions. Word has length 16 [2022-03-15 22:19:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:14,933 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 2790 transitions. [2022-03-15 22:19:14,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 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 22:19:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2790 transitions. [2022-03-15 22:19:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:14,936 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:14,936 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:14,961 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 22:19:15,151 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,SelfDestructingSolverStorable14 [2022-03-15 22:19:15,152 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1822388072, now seen corresponding path program 8 times [2022-03-15 22:19:15,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:15,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753808310] [2022-03-15 22:19:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:15,407 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 22:19:15,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:15,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753808310] [2022-03-15 22:19:15,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753808310] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:15,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010559585] [2022-03-15 22:19:15,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:19:15,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:15,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:15,412 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 22:19:15,439 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 22:19:15,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:19:15,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:15,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:19:15,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:15,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:15,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:15,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:15,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:19:15,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:15,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:19:15,704 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-03-15 22:19:15,734 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 22:19:15,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:15,897 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:19:15,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 32 treesize of output 97 [2022-03-15 22:19:16,493 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 22:19:16,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010559585] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:16,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:16,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:19:16,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237632377] [2022-03-15 22:19:16,494 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:16,495 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:16,503 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:19:16,503 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:22,332 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [18935#(and (or (= sum2 0) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k)))) (or (not (< (+ k 1) N)) (< j M) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N))), 18943#(and (or (not (< (+ 2 k) N)) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k))) (< j M) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (< j M) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) (+ (select A i) sum1))) (or (not (< (+ 2 k) N)) (= sum2 0) (< j M) (<= (+ 2 i) N) (< (+ 3 k) N))), 18944#(and (or (<= (+ 3 i) N) (= sum2 0) (< j M)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) sum1 (select A (+ i 1))) sum3)) (or (< j M) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< j M) (<= sum3 (+ (select A i) sum1 (select A (+ i 1)))))), 18930#(and (or (< j M) (<= sum3 (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (= sum2 0) (< j M) (<= (+ 2 i) N)) (or (< j M) (<= (+ 2 i) N) (<= (+ (select A i) sum1) sum3))), 18923#(and (or (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k)))) (or (= sum2 0) (not (< (+ k 1) N)) (< (+ 2 k) N))), 18917#(and (or (not (< k N)) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k)))) (or (not (< k N)) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N)) (or (not (< k N)) (= sum2 0) (< (+ k 1) N))), 18915#(and (or (< k N) (<= sum1 sum3)) (or (= sum2 0) (< k N)) (or (<= sum3 sum1) (< k N))), 18940#(and (or (not (< (+ 2 k) N)) (= sum2 0) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k))) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) (+ (select A i) sum1)))), 18928#(and (or (not (< k N)) (< j M) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k)))) (or (not (< k N)) (= sum2 0) (< j M) (< (+ k 1) N))), 18926#(and (or (= sum2 0) (< j M) (< i N)) (or (< j M) (<= sum1 sum3) (< i N)) (or (< j M) (<= sum3 sum1) (< i N))), 18945#(and (or (<= (+ 3 i) N) (< j M) (< k N) (<= (+ (select A i) sum1 (select A (+ i 1))) sum3)) (or (<= (+ 3 i) N) (< j M) (<= sum3 (+ (select A i) sum1 (select A (+ i 1)))) (< k N)) (or (<= (+ 3 i) N) (= sum2 0) (< j M) (< k N)) (or (< j M) (< k N) (<= (+ 2 i) N))), 18951#(and (or (<= (+ i 4) N) (< j M) (<= sum3 (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))))) (or (<= (+ i 4) N) (< j M) (<= (+ (select A i) (select A (+ 2 i)) sum1 (select A (+ i 1))) sum3)) (or (< j M) (= i 0)) (or (= sum2 0) (<= (+ i 4) N) (< j M)) (or (<= 3 N) (< j M)) (or (< j M) (= sum1 0) (< 3 N))), 18946#(and (or (<= (+ 3 i) N) (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum3 (select A k)))) (or (<= (+ 3 i) N) (not (< k N)) (< j M) (<= (+ sum3 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ k 1) N)) (or (<= (+ 3 i) N) (not (< k N)) (= sum2 0) (< j M) (< (+ k 1) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N))), 18941#(and (or (not (< (+ 2 k) N)) (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k))) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (= sum2 0) (< j M) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) sum1) (< (+ 3 k) N))), 18938#(and (or (not (< (+ 2 k) N)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) sum1) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (= sum2 0) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k))) (< (+ 3 k) N))), 18932#(and (or (not (< k N)) (<= (+ (select A i) sum1) (+ sum3 (select A k))) (< j M) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= (+ sum3 (select A k)) (+ (select A i) sum1)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= sum2 0) (< j M) (< (+ k 1) N) (<= (+ 2 i) N))), 18916#(and (or (< k N) (<= sum1 sum3) (< i N)) (or (= sum2 0) (< k N) (< i N)) (or (<= sum3 sum1) (< k N) (< i N))), 18921#(and (or (<= (+ 3 i) N) (< k N) (<= (+ (select A i) sum1 (select A (+ i 1))) sum3)) (or (< k N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= sum2 0) (< k N)) (or (<= (+ 3 i) N) (<= sum3 (+ (select A i) sum1 (select A (+ i 1)))) (< k N))), 18942#(and (or (not (< (+ 2 k) N)) (< j M) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k))) (< (+ 3 k) N) (< i N)) (or (not (< (+ 2 k) N)) (= sum2 0) (< j M) (< (+ 3 k) N) (< i N)) (or (not (< (+ 2 k) N)) (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) sum1) (< (+ 3 k) N) (< i N))), 18925#(and (or (= sum2 0) (< j M) (< k N)) (or (< j M) (<= sum3 sum1) (< k N)) (or (< j M) (< k N) (<= sum1 sum3))), 18924#(and (or (= sum2 0) (< j M)) (or (< j M) (<= sum3 sum1)) (or (< j M) (<= sum1 sum3))), 18929#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k))) (< i N)) (or (not (< k N)) (< j M) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N) (< i N)) (or (not (< k N)) (= sum2 0) (< j M) (< (+ k 1) N) (< i N))), 18953#(and (or (< j M) (= i 0)) (or (< j M) (<= 1 k)) (or (< j M) (<= (select A i) sum3)) (or (= sum2 0) (< j M)) (or (<= sum3 (select A i)) (< j M)) (or (< j M) (= sum1 0))), 18954#(and (or (< j M) (<= k 0)) (or (< j M) (= i 0)) (or (= sum2 0) (< j M)) (or (< j M) (= sum1 0)) (or (< j M) (<= 0 k)) (or (= sum3 0) (< j M))), 18933#(and (or (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N) (< i N)) (or (= sum2 0) (not (< (+ k 1) N)) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k))) (< i N))), 18950#(and (or (<= (+ 3 i) N) (not (< (+ 2 k) N)) (< j M) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (not (< (+ 2 k) N)) (= sum2 0) (< j M) (< (+ 3 k) N)) (or (not (< (+ 2 k) N)) (< j M) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (not (< (+ 2 k) N)) (< j M) (< (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k))))), 18952#(and (or (= sum2 0) (< j M) (< 2 k)) (or (< j M) (< 2 k) (<= sum3 (+ (select A i) (select A (+ (- 1) k))))) (or (< j M) (<= 2 k)) (or (< j M) (< 2 k) (<= (+ (select A i) (select A (+ (- 1) k))) sum3)) (or (< j M) (= i 0)) (or (< j M) (= sum1 0) (< 2 k))), 18936#(and (or (not (< (+ k 1) N)) (< j M) (<= (+ (select A (+ k 1)) sum3 (select A k)) sum1) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= sum1 (+ (select A (+ k 1)) sum3 (select A k))) (< i N)) (or (= sum2 0) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (< i N))), 18919#(and (or (<= sum3 (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N)) (or (< k N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) sum3)) (or (= sum2 0) (< k N) (<= (+ 2 i) N))), 18939#(and (or (not (< (+ 2 k) N)) (= sum2 0) (< (+ 3 k) N) (< i N)) (or (not (< (+ 2 k) N)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) sum1) (< (+ 3 k) N) (< i N)) (or (not (< (+ 2 k) N)) (<= sum1 (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k))) (< (+ 3 k) N) (< i N))), 18931#(and (or (= sum2 0) (< j M) (< k N) (<= (+ 2 i) N)) (or (< j M) (< k N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) sum3)) (or (< j M) (<= sum3 (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N))), 18918#(and (or (not (< k N)) (= sum2 0) (< (+ k 1) N) (< i N)) (or (not (< k N)) (<= (+ sum3 (select A k)) sum1) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= sum1 (+ sum3 (select A k))) (< i N))), 18927#(and (or (= sum2 0) (< j M) (< k N) (< i N)) (or (< j M) (< k N) (<= sum1 sum3) (< i N)) (or (< j M) (<= sum3 sum1) (< k N) (< i N))), 18920#(and (or (not (< k N)) (<= (+ sum3 (select A k)) (+ (select A i) sum1)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= sum2 0) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ (select A i) sum1) (+ sum3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N))), 18922#(and (or (<= (+ 3 i) N) (not (< k N)) (<= (+ sum3 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< k N)) (= sum2 0) (< (+ k 1) N)) (or (<= (+ 3 i) N) (not (< k N)) (< (+ k 1) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum3 (select A k))))), 18947#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (= sum2 0) (not (< (+ k 1) N)) (< (+ 2 k) N)) (or (<= (+ 3 i) N) (not (< (+ k 1) N)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum3 (select A k))) (< (+ 2 k) N)) (or (<= (+ 3 i) N) (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) sum3 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 2 k) N))), 18948#(and (or (<= (+ 3 i) N) (= sum2 0) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< (+ k 1) N)) (< j M) (<= (+ (select A (+ k 1)) sum3 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 2 k) N)) (or (<= (+ 3 i) N) (not (< (+ k 1) N)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum3 (select A k))) (< j M) (< (+ 2 k) N))), 18934#(and (or (= sum2 0) (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum3 (select A k))) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) sum3 (select A k)) (+ (select A i) sum1)))), 18937#(and (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ (select A (+ k 1)) sum3 (select A k)) (+ (select A i) sum1))) (or (= sum2 0) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum3 (select A k))) (< (+ 2 k) N) (<= (+ 2 i) N))), 18949#(and (or (<= (+ 3 i) N) (not (< (+ 2 k) N)) (= sum2 0) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (not (< (+ 2 k) N)) (< (+ 3 k) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)))) (or (not (< (+ 2 k) N)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (not (< (+ 2 k) N)) (<= (+ (select A (+ k 1)) (select A (+ 2 k)) sum3 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 3 k) N)))] [2022-03-15 22:19:22,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:19:22,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:19:22,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=3647, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:19:22,334 INFO L87 Difference]: Start difference. First operand 727 states and 2790 transitions. Second operand has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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 22:19:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:53,169 INFO L93 Difference]: Finished difference Result 1451 states and 5027 transitions. [2022-03-15 22:19:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2022-03-15 22:19:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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 22:19:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:53,176 INFO L225 Difference]: With dead ends: 1451 [2022-03-15 22:19:53,176 INFO L226 Difference]: Without dead ends: 1424 [2022-03-15 22:19:53,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16905 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=7237, Invalid=40505, Unknown=0, NotChecked=0, Total=47742 [2022-03-15 22:19:53,178 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 766 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:53,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 0 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2943 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 22:19:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-03-15 22:19:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 814. [2022-03-15 22:19:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.896678966789668) internal successors, (3168), 813 states have internal predecessors, (3168), 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 22:19:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 3168 transitions. [2022-03-15 22:19:53,202 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 3168 transitions. Word has length 17 [2022-03-15 22:19:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:53,202 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 3168 transitions. [2022-03-15 22:19:53,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 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 22:19:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 3168 transitions. [2022-03-15 22:19:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:53,205 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:53,205 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:53,223 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 22:19:53,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:53,414 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash -633677775, now seen corresponding path program 9 times [2022-03-15 22:19:53,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:53,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247741825] [2022-03-15 22:19:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:53,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:53,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247741825] [2022-03-15 22:19:53,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247741825] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:53,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75884418] [2022-03-15 22:19:53,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:19:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:53,472 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 22:19:53,502 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 22:19:53,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:19:53,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:53,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:19:53,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:53,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:53,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75884418] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:53,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:53,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-03-15 22:19:53,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868145245] [2022-03-15 22:19:53,663 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:53,664 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:53,671 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:19:53,671 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:54,348 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [22461#(or (<= N k) (< i N)), 22468#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 22465#(or (<= N (+ i 1)) (< (+ 2 i) N)), 22458#(or (<= N i) (< (+ i 1) N)), 22464#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 22459#(or (<= (+ N 1) k) (< i N)), 22467#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 22457#(< i N), 22462#(or (<= N i) (< (+ i 1) N) (<= N k)), 22466#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N 1) k)), 22460#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 22463#(or (<= N (+ k 1)) (< i N))] [2022-03-15 22:19:54,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:19:54,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:19:54,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:19:54,349 INFO L87 Difference]: Start difference. First operand 814 states and 3168 transitions. Second operand has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 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 22:19:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:55,130 INFO L93 Difference]: Finished difference Result 1409 states and 5086 transitions. [2022-03-15 22:19:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:19:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 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 22:19:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:55,136 INFO L225 Difference]: With dead ends: 1409 [2022-03-15 22:19:55,136 INFO L226 Difference]: Without dead ends: 1345 [2022-03-15 22:19:55,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1114, Invalid=3442, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 22:19:55,137 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:55,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:19:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-03-15 22:19:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 740. [2022-03-15 22:19:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.8403247631935047) internal successors, (2838), 739 states have internal predecessors, (2838), 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 22:19:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2838 transitions. [2022-03-15 22:19:55,161 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2838 transitions. Word has length 17 [2022-03-15 22:19:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:55,161 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 2838 transitions. [2022-03-15 22:19:55,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 states have internal predecessors, (80), 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 22:19:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2838 transitions. [2022-03-15 22:19:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:19:55,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:55,163 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:55,186 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 22:19:55,386 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,SelfDestructingSolverStorable16 [2022-03-15 22:19:55,386 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:19:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash -789180409, now seen corresponding path program 7 times [2022-03-15 22:19:55,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:55,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861054333] [2022-03-15 22:19:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:55,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:55,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861054333] [2022-03-15 22:19:55,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861054333] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:55,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423046551] [2022-03-15 22:19:55,572 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:19:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:55,573 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:19:55,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 22:19:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:55,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:19:55,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:19,945 INFO L353 Elim1Store]: treesize reduction 82, result has 7.9 percent of original size [2022-03-15 22:20:19,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 89 [2022-03-15 22:20:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:20,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:33,024 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:20:33,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 30 treesize of output 115 [2022-03-15 22:20:37,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:37,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:20:37,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 74 [2022-03-15 22:20:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:38,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423046551] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:38,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:38,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 22:20:38,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [654044713] [2022-03-15 22:20:38,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:38,710 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:38,735 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 219 transitions. [2022-03-15 22:20:38,735 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:22:11,826 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [25573#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (< sum1 (+ (select A j) sum3 sum2 (select A k) 1)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A j) sum3 sum2 (select A k)) sum1) (not (< j M)) (< (+ k 1) N) (< i N))), 25583#(and (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< k N) (<= (+ (select A i) sum1 (select A (+ (- 1) N))) (+ (select A j) sum3 sum2))) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< k N) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1 (select A (+ (- 1) N))))) (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ 2 i) N))), 25595#(and (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k))))), 25570#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1))), 25578#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) sum1) (+ (select A j) sum3 sum2 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A j) sum3 sum2 (select A k)) (+ (select A i) sum1)))), 25597#(and (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (< j M) (= sum1 0)) (or (< (+ 2 i) k) (< j M) (<= (+ (select A i) (select A (+ (- 1) k))) (+ sum3 sum2))) (or (< (+ 2 i) k) (< j M) (<= (+ sum3 sum2) (+ (select A i) (select A (+ (- 1) k)))))), 25558#(and (or (<= (+ sum3 sum2) (+ (select A i) sum1 (select A (+ (- 1) N)))) (< (+ 2 i) N) (< k N)) (or (< k N) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (<= (+ (select A i) sum1 (select A (+ (- 1) N))) (+ sum3 sum2)) (< k N))), 25571#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (< sum1 (+ (select A j) sum3 sum2 (select A k) 1))) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A j) sum3 sum2 (select A k)) sum1) (not (< j M)) (< (+ k 1) N))), 25568#(and (or (< j M) (< sum1 (+ sum3 sum2 1)) (< k N) (< i N)) (or (< j M) (<= (+ sum3 sum2) sum1) (< k N) (< i N))), 25565#(and (or (< (+ j 1) M) (not (< j M)) (< i N) (<= (+ (select A j) sum3 sum2) sum1)) (or (< (+ j 1) M) (not (< j M)) (< i N) (< sum1 (+ (select A j) sum3 sum2 1)))), 25563#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (< sum1 (+ (select A (+ k 1)) sum3 sum2 (select A k) 1))) (or (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) sum1) (not (< (+ k 1) N)) (< (+ 2 k) N))), 25575#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ sum3 sum2 (select A k)))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ sum3 sum2 (select A k)) (+ (select A i) sum1)))), 25559#(and (or (not (< k N)) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1))) (or (not (< k N)) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1))), 25598#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (<= (+ (select A i) sum1 (select A (+ (- 1) N)) (select A (+ i 1))) (+ (select A j) sum3 sum2))) (or (< (+ j 1) M) (<= (+ (select A j) sum3 sum2) (+ (select A i) (select A (+ (- 2) N)) (select A (+ (- 1) N)))) (not (< j M)) (< (+ 3 i) N)) (or (< (+ j 1) M) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1 (select A (+ (- 1) N)) (select A (+ i 1)))) (not (< j M)) (< (+ 3 i) N)) (or (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (<= (+ (select A i) (select A (+ (- 2) N)) (select A (+ (- 1) N))) (+ (select A j) sum3 sum2)))), 25564#(and (or (< (+ j 1) M) (not (< j M)) (< sum1 (+ (select A j) sum3 sum2 1))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum3 sum2) sum1))), 25556#(and (or (< sum1 (+ sum3 sum2 1)) (< k N) (<= (+ i 1) N)) (or (<= (+ sum3 sum2) sum1) (< k N) (<= (+ i 1) N))), 25554#(and (or (< j M) (<= (+ sum3 sum2) (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (< j M) (<= (+ (select A i) sum1) (+ sum3 sum2)) (<= (+ 2 i) N))), 25553#(and (or (< j M) (<= (+ sum3 sum2) sum1) (<= (+ i 1) N)) (or (< j M) (< sum1 (+ sum3 sum2 1)) (<= (+ i 1) N))), 25584#(and (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ (select A i) sum1 (select A (+ (- 1) N))) (+ (select A j) sum3 sum2 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (< (+ k 1) N) (<= (+ (select A j) sum3 sum2 (select A k)) (+ (select A i) sum1 (select A (+ (- 1) N))))) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N))), 25593#(and (or (< sum1 (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k) 1)) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (< i N)) (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k)) sum1) (< i N))), 25566#(and (or (< j M) (<= (+ sum3 sum2) sum1) (< k N)) (or (< j M) (< sum1 (+ sum3 sum2 1)) (< k N))), 25591#(and (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< (+ k 1) N)) (< j M) (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 2 k) N)) (or (<= (+ 3 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum3 sum2 (select A k))) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N))), 25555#(and (or (< sum1 (+ sum3 sum2 1)) (< k N)) (or (<= (+ sum3 sum2) sum1) (< k N))), 25562#(and (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (not (< k N)) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1))))) (or (<= (+ 3 i) N) (not (< k N)) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ sum3 sum2 (select A k))) (< (+ k 1) N))), 25594#(and (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A i) sum1) (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k))) (<= (+ 2 i) N)) (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k)) (+ (select A i) sum1)) (<= (+ 2 i) N))), 25599#(and (or (< (+ j 1) M) (<= (+ 2 i) k) (not (< j M))) (or (< (+ 2 i) k) (< (+ j 1) M) (<= (+ (select A i) (select A (+ (- 1) k))) (+ (select A j) sum3 sum2)) (not (< j M))) (or (< (+ 2 i) k) (< (+ j 1) M) (<= (+ (select A j) sum3 sum2) (+ (select A i) (select A (+ (- 1) k)))) (not (< j M))) (or (< (+ 2 i) k) (< (+ j 1) M) (= sum1 0) (not (< j M)))), 25585#(and (or (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) sum1) (not (< (+ k 1) N)) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< (+ 2 k) N) (< sum1 (+ (select A (+ k 1)) sum3 sum2 (select A k) 1)) (< i N))), 25572#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1)) (< i N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1) (< i N))), 25589#(and (or (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) sum1) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (< i N)) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (< sum1 (+ (select A (+ k 1)) sum3 sum2 (select A k) 1)) (< i N))), 25552#(and (or (< j M) (<= (+ sum3 sum2) sum1)) (or (< j M) (< sum1 (+ sum3 sum2 1)))), 25576#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ (select A j) sum3 sum2))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1)) (<= (+ 2 i) N))), 25588#(and (or (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) sum1) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N)) (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (< sum1 (+ (select A (+ k 1)) sum3 sum2 (select A k) 1)))), 25581#(and (or (not (< k N)) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) (+ (select A i) sum1 (select A (+ (- 1) N))))) (or (not (< k N)) (<= (+ (select A i) sum1 (select A (+ (- 1) N))) (+ sum3 sum2 (select A k))) (< (+ 2 i) N) (< j M) (< (+ k 1) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N))), 25586#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum3 sum2 (select A k))) (< (+ 2 k) N) (<= (+ 2 i) N))), 25592#(and (or (< sum1 (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k) 1)) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M))) (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) (select A (+ k 1)) sum3 sum2 (select A k)) sum1))), 25574#(and (or (< j M) (<= (+ (select A i) sum1) (+ sum3 sum2)) (< k N) (<= (+ 2 i) N)) (or (< j M) (<= (+ sum3 sum2) (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N))), 25582#(and (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1 (select A (+ (- 1) N))))) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (<= (+ (select A i) sum1 (select A (+ (- 1) N))) (+ (select A j) sum3 sum2)))), 25596#(and (or (< j M) (<= (+ (select A i) sum1 (select A (+ (- 1) N)) (select A (+ i 1))) (+ sum3 sum2)) (< (+ 3 i) N)) (or (< j M) (< (+ 3 i) N) (<= (+ sum3 sum2) (+ (select A i) (select A (+ (- 2) N)) (select A (+ (- 1) N))))) (or (< j M) (< (+ 3 i) N) (<= (+ sum3 sum2) (+ (select A i) sum1 (select A (+ (- 1) N)) (select A (+ i 1))))) (or (<= (+ 3 i) N) (< j M)) (or (< j M) (<= (+ (select A i) (select A (+ (- 2) N)) (select A (+ (- 1) N))) (+ sum3 sum2)) (< (+ 3 i) N))), 25557#(and (or (<= (+ sum3 sum2) (+ (select A i) sum1)) (< k N) (<= (+ 2 i) N)) (or (<= (+ (select A i) sum1) (+ sum3 sum2)) (< k N) (<= (+ 2 i) N))), 25560#(and (or (not (< k N)) (<= (+ i 1) N) (< (+ k 1) N) (< sum1 (+ sum3 sum2 (select A k) 1))) (or (not (< k N)) (<= (+ i 1) N) (< (+ k 1) N) (<= (+ sum3 sum2 (select A k)) sum1))), 25567#(and (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ (select A j) sum3 sum2) sum1)) (or (< (+ j 1) M) (not (< j M)) (< k N) (< sum1 (+ (select A j) sum3 sum2 1)))), 25580#(and (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) sum1 (select A (+ (- 1) N))) (+ sum3 sum2)) (< k N)) (or (<= (+ sum3 sum2) (+ (select A i) sum1 (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M) (< k N)) (or (< j M) (< k N) (<= (+ 2 i) N))), 25561#(and (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ sum3 sum2 (select A k)))) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ sum3 sum2 (select A k)) (+ (select A i) sum1)))), 25579#(and (or (<= (+ sum3 sum2) (+ (select A i) sum1 (select A (+ (- 1) N)))) (< (+ 2 i) N) (< j M)) (or (< j M) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) sum1 (select A (+ (- 1) N))) (+ sum3 sum2)))), 25569#(and (or (< (+ j 1) M) (not (< j M)) (< k N) (< i N) (< sum1 (+ (select A j) sum3 sum2 1))) (or (< (+ j 1) M) (not (< j M)) (< k N) (< i N) (<= (+ (select A j) sum3 sum2) sum1))), 25587#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (<= (+ (select A i) sum1 (select A (+ i 1))) (+ (select A (+ k 1)) sum3 sum2 (select A k))) (not (< (+ k 1) N)) (< (+ 2 k) N)) (or (<= (+ 3 i) N) (not (< (+ k 1) N)) (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) (+ (select A i) sum1 (select A (+ i 1)))) (< (+ 2 k) N))), 25577#(and (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ (select A j) sum3 sum2) (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (< (+ j 1) M) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (+ (select A i) sum1) (+ (select A j) sum3 sum2)))), 25590#(and (or (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (<= (+ (select A (+ k 1)) sum3 sum2 (select A k)) (+ (select A i) sum1)) (<= (+ 2 i) N)) (or (not (< (+ k 1) N)) (< j M) (<= (+ (select A i) sum1) (+ (select A (+ k 1)) sum3 sum2 (select A k))) (< (+ 2 k) N) (<= (+ 2 i) N)))] [2022-03-15 22:22:11,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 22:22:11,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:22:11,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 22:22:11,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=4604, Unknown=11, NotChecked=0, Total=5112 [2022-03-15 22:22:11,828 INFO L87 Difference]: Start difference. First operand 740 states and 2838 transitions. Second operand has 58 states, 57 states have (on average 2.982456140350877) internal successors, (170), 57 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:32:24,256 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:32:24,275 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:32:25,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 22:32:25,476 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 22:32:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-03-15 22:32:25,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14595 ImplicationChecksByTransitivity, 717.9s TimeCoverageRelationStatistics Valid=7102, Invalid=37195, Unknown=13, NotChecked=0, Total=44310 [2022-03-15 22:32:25,540 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 483 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:32:25,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 0 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-03-15 22:32:25,543 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 [2022-03-15 22:32:25,544 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:32:25,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 22:32:25,545 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 146 states, 58 states before enhancement),while executing Executor. [2022-03-15 22:32:25,546 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:32:25,546 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:32:25,546 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:32:25,548 INFO L732 BasicCegarLoop]: Path program histogram: [9, 7, 1, 1] [2022-03-15 22:32:25,549 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:32:25,549 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:32:25,552 INFO L202 PluginConnector]: Adding new model sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:32:25 BasicIcfg [2022-03-15 22:32:25,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:32:25,552 INFO L158 Benchmark]: Toolchain (without parser) took 850837.13ms. Allocated memory was 179.3MB in the beginning and 304.1MB in the end (delta: 124.8MB). Free memory was 137.6MB in the beginning and 112.3MB in the end (delta: 25.3MB). Peak memory consumption was 151.7MB. Max. memory is 8.0GB. [2022-03-15 22:32:25,553 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:32:25,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.02ms. Allocated memory is still 179.3MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:32:25,553 INFO L158 Benchmark]: Boogie Preprocessor took 11.97ms. Allocated memory is still 179.3MB. Free memory was 136.0MB in the beginning and 135.1MB in the end (delta: 922.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:32:25,554 INFO L158 Benchmark]: RCFGBuilder took 265.56ms. Allocated memory is still 179.3MB. Free memory was 135.0MB in the beginning and 125.8MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:32:25,554 INFO L158 Benchmark]: TraceAbstraction took 850525.72ms. Allocated memory was 179.3MB in the beginning and 304.1MB in the end (delta: 124.8MB). Free memory was 125.3MB in the beginning and 112.3MB in the end (delta: 13.0MB). Peak memory consumption was 139.1MB. Max. memory is 8.0GB. [2022-03-15 22:32:25,555 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.10ms. Allocated memory is still 179.3MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.02ms. Allocated memory is still 179.3MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.97ms. Allocated memory is still 179.3MB. Free memory was 136.0MB in the beginning and 135.1MB in the end (delta: 922.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.56ms. Allocated memory is still 179.3MB. Free memory was 135.0MB in the beginning and 125.8MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 850525.72ms. Allocated memory was 179.3MB in the beginning and 304.1MB in the end (delta: 124.8MB). Free memory was 125.3MB in the beginning and 112.3MB in the end (delta: 13.0MB). Peak memory consumption was 139.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 116, positive conditional: 0, positive unconditional: 116, 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: 70, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 116, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 146 states, 58 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 146 states, 58 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 146 states, 58 states before enhancement),while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (740states) and FLOYD_HOARE automaton (currently 146 states, 58 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 850.4s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 682.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4511 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4511 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3869 mSDsCounter, 2428 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15172 IncrementalHoareTripleChecker+Invalid, 17600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2428 mSolverCounterUnsat, 0 mSDtfsCounter, 15172 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2439 GetRequests, 903 SyntacticMatches, 45 SemanticMatches, 1490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73260 ImplicationChecksByTransitivity, 784.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=16, InterpolantAutomatonStates: 1025, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 4163 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 48.4s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 711 ConstructedInterpolants, 21 QuantifiedInterpolants, 7271 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1054 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 133/334 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown