./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d17ef4c86a3b9aaad0f3756316af6b356203f50f5a16d9fd49cf45964daad71 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:28:43,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:28:43,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:28:43,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:28:43,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:28:43,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:28:43,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:28:43,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:28:43,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:28:43,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:28:43,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:28:43,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:28:43,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:28:43,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:28:43,737 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:28:43,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:28:43,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:28:43,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:28:43,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:28:43,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:28:43,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:28:43,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:28:43,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:28:43,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:28:43,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:28:43,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:28:43,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:28:43,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:28:43,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:28:43,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:28:43,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:28:43,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:28:43,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:43,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:28:43,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:28:43,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:28:43,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:28:43,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:28:43,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:28:43,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:28:43,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:28:43,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:28:43,745 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d17ef4c86a3b9aaad0f3756316af6b356203f50f5a16d9fd49cf45964daad71 [2024-11-08 10:28:43,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:28:43,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:28:43,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:28:43,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:28:43,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:28:43,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label12.c [2024-11-08 10:28:45,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:28:45,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:28:45,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label12.c [2024-11-08 10:28:45,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36595125a/529422d73e144b05ace57978887a4667/FLAG990f26a72 [2024-11-08 10:28:45,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36595125a/529422d73e144b05ace57978887a4667 [2024-11-08 10:28:45,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:28:45,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:28:45,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:45,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:28:45,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:28:45,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:45" (1/1) ... [2024-11-08 10:28:45,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cb2e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:45, skipping insertion in model container [2024-11-08 10:28:45,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:45" (1/1) ... [2024-11-08 10:28:45,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:28:46,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label12.c[56222,56235] [2024-11-08 10:28:46,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:46,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:28:46,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label12.c[56222,56235] [2024-11-08 10:28:46,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:46,376 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:28:46,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46 WrapperNode [2024-11-08 10:28:46,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:46,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:46,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:28:46,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:28:46,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,534 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:28:46,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:46,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:28:46,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:28:46,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:28:46,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:28:46,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:28:46,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:28:46,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:28:46,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:28:46,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (1/1) ... [2024-11-08 10:28:46,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:46,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:46,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:28:46,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:28:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:28:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:28:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:28:46,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:28:46,764 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:28:46,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:28:48,061 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:28:48,061 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:28:48,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:28:48,079 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:28:48,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:48 BoogieIcfgContainer [2024-11-08 10:28:48,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:28:48,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:28:48,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:28:48,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:28:48,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:28:45" (1/3) ... [2024-11-08 10:28:48,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a5ee2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:48, skipping insertion in model container [2024-11-08 10:28:48,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:46" (2/3) ... [2024-11-08 10:28:48,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a5ee2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:48, skipping insertion in model container [2024-11-08 10:28:48,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:48" (3/3) ... [2024-11-08 10:28:48,089 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label12.c [2024-11-08 10:28:48,100 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:28:48,101 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:28:48,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:28:48,159 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@411bc499, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:28:48,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:28:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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) [2024-11-08 10:28:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 10:28:48,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:48,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:48,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1237142429, now seen corresponding path program 1 times [2024-11-08 10:28:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667810576] [2024-11-08 10:28:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667810576] [2024-11-08 10:28:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667810576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776037124] [2024-11-08 10:28:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:48,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:48,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:48,900 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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) [2024-11-08 10:28:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:49,717 INFO L93 Difference]: Finished difference Result 855 states and 1496 transitions. [2024-11-08 10:28:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 163 [2024-11-08 10:28:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:49,728 INFO L225 Difference]: With dead ends: 855 [2024-11-08 10:28:49,728 INFO L226 Difference]: Without dead ends: 460 [2024-11-08 10:28:49,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:49,733 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 133 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:49,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 176 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:28:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-08 10:28:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2024-11-08 10:28:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 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) [2024-11-08 10:28:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2024-11-08 10:28:49,777 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 163 [2024-11-08 10:28:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2024-11-08 10:28:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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) [2024-11-08 10:28:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2024-11-08 10:28:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 10:28:49,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:49,780 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:49,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:28:49,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:49,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash 765720979, now seen corresponding path program 1 times [2024-11-08 10:28:49,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986442332] [2024-11-08 10:28:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:49,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:49,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986442332] [2024-11-08 10:28:49,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986442332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:49,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:49,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:49,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557691195] [2024-11-08 10:28:49,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:49,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:49,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:49,981 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 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) [2024-11-08 10:28:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:50,610 INFO L93 Difference]: Finished difference Result 1342 states and 2082 transitions. [2024-11-08 10:28:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 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 168 [2024-11-08 10:28:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:50,614 INFO L225 Difference]: With dead ends: 1342 [2024-11-08 10:28:50,614 INFO L226 Difference]: Without dead ends: 885 [2024-11-08 10:28:50,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:50,616 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:50,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 181 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-08 10:28:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 880. [2024-11-08 10:28:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.4687144482366326) internal successors, (1291), 879 states have internal predecessors, (1291), 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) [2024-11-08 10:28:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1291 transitions. [2024-11-08 10:28:50,658 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1291 transitions. Word has length 168 [2024-11-08 10:28:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1291 transitions. [2024-11-08 10:28:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 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) [2024-11-08 10:28:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1291 transitions. [2024-11-08 10:28:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 10:28:50,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:50,661 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:50,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:28:50,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:50,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:50,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1994637924, now seen corresponding path program 1 times [2024-11-08 10:28:50,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:50,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460518887] [2024-11-08 10:28:50,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:50,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460518887] [2024-11-08 10:28:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460518887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702405937] [2024-11-08 10:28:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:50,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:50,795 INFO L87 Difference]: Start difference. First operand 880 states and 1291 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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) [2024-11-08 10:28:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:51,470 INFO L93 Difference]: Finished difference Result 2594 states and 3822 transitions. [2024-11-08 10:28:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:51,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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 171 [2024-11-08 10:28:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:51,476 INFO L225 Difference]: With dead ends: 2594 [2024-11-08 10:28:51,476 INFO L226 Difference]: Without dead ends: 1716 [2024-11-08 10:28:51,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:51,479 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:51,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-08 10:28:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1696. [2024-11-08 10:28:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 1.4395280235988202) internal successors, (2440), 1695 states have internal predecessors, (2440), 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) [2024-11-08 10:28:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2440 transitions. [2024-11-08 10:28:51,513 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2440 transitions. Word has length 171 [2024-11-08 10:28:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:51,513 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2440 transitions. [2024-11-08 10:28:51,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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) [2024-11-08 10:28:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2440 transitions. [2024-11-08 10:28:51,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 10:28:51,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:51,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:51,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:28:51,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:51,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1309995303, now seen corresponding path program 1 times [2024-11-08 10:28:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416612504] [2024-11-08 10:28:51,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:28:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:51,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416612504] [2024-11-08 10:28:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416612504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:51,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248484926] [2024-11-08 10:28:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:51,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:51,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:51,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:51,703 INFO L87 Difference]: Start difference. First operand 1696 states and 2440 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:52,346 INFO L93 Difference]: Finished difference Result 5027 states and 7244 transitions. [2024-11-08 10:28:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2024-11-08 10:28:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:52,357 INFO L225 Difference]: With dead ends: 5027 [2024-11-08 10:28:52,357 INFO L226 Difference]: Without dead ends: 3333 [2024-11-08 10:28:52,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:52,361 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 96 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:52,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 387 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2024-11-08 10:28:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3325. [2024-11-08 10:28:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3324 states have (on average 1.3775571600481349) internal successors, (4579), 3324 states have internal predecessors, (4579), 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) [2024-11-08 10:28:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4579 transitions. [2024-11-08 10:28:52,408 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4579 transitions. Word has length 178 [2024-11-08 10:28:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:52,409 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 4579 transitions. [2024-11-08 10:28:52,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4579 transitions. [2024-11-08 10:28:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 10:28:52,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:52,414 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:52,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:28:52,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:52,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash -281310709, now seen corresponding path program 1 times [2024-11-08 10:28:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:52,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588109661] [2024-11-08 10:28:52,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:52,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:28:52,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588109661] [2024-11-08 10:28:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588109661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916405567] [2024-11-08 10:28:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:52,639 INFO L87 Difference]: Start difference. First operand 3325 states and 4579 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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) [2024-11-08 10:28:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:53,241 INFO L93 Difference]: Finished difference Result 8286 states and 11311 transitions. [2024-11-08 10:28:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:53,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 184 [2024-11-08 10:28:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:53,253 INFO L225 Difference]: With dead ends: 8286 [2024-11-08 10:28:53,253 INFO L226 Difference]: Without dead ends: 4963 [2024-11-08 10:28:53,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:53,257 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 216 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:53,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 393 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2024-11-08 10:28:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 4958. [2024-11-08 10:28:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4958 states, 4957 states have (on average 1.333266088359895) internal successors, (6609), 4957 states have internal predecessors, (6609), 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) [2024-11-08 10:28:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 6609 transitions. [2024-11-08 10:28:53,320 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 6609 transitions. Word has length 184 [2024-11-08 10:28:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:53,320 INFO L471 AbstractCegarLoop]: Abstraction has 4958 states and 6609 transitions. [2024-11-08 10:28:53,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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) [2024-11-08 10:28:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 6609 transitions. [2024-11-08 10:28:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 10:28:53,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:53,327 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:28:53,327 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:53,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -556225326, now seen corresponding path program 1 times [2024-11-08 10:28:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495660729] [2024-11-08 10:28:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:28:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495660729] [2024-11-08 10:28:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495660729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:53,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179299944] [2024-11-08 10:28:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:53,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:53,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:53,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:53,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:53,529 INFO L87 Difference]: Start difference. First operand 4958 states and 6609 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 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) [2024-11-08 10:28:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:54,124 INFO L93 Difference]: Finished difference Result 12402 states and 16491 transitions. [2024-11-08 10:28:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:54,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 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) Word has length 206 [2024-11-08 10:28:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:54,143 INFO L225 Difference]: With dead ends: 12402 [2024-11-08 10:28:54,143 INFO L226 Difference]: Without dead ends: 7446 [2024-11-08 10:28:54,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:54,149 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 222 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:54,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 129 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7446 states. [2024-11-08 10:28:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7446 to 7441. [2024-11-08 10:28:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7441 states, 7440 states have (on average 1.3233870967741936) internal successors, (9846), 7440 states have internal predecessors, (9846), 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) [2024-11-08 10:28:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 9846 transitions. [2024-11-08 10:28:54,281 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 9846 transitions. Word has length 206 [2024-11-08 10:28:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:54,281 INFO L471 AbstractCegarLoop]: Abstraction has 7441 states and 9846 transitions. [2024-11-08 10:28:54,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 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) [2024-11-08 10:28:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 9846 transitions. [2024-11-08 10:28:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 10:28:54,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:54,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:54,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:28:54,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:54,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1273445659, now seen corresponding path program 1 times [2024-11-08 10:28:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68505855] [2024-11-08 10:28:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68505855] [2024-11-08 10:28:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68505855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:54,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448501495] [2024-11-08 10:28:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:54,504 INFO L87 Difference]: Start difference. First operand 7441 states and 9846 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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) [2024-11-08 10:28:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:55,139 INFO L93 Difference]: Finished difference Result 21376 states and 28296 transitions. [2024-11-08 10:28:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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 207 [2024-11-08 10:28:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:55,168 INFO L225 Difference]: With dead ends: 21376 [2024-11-08 10:28:55,168 INFO L226 Difference]: Without dead ends: 13937 [2024-11-08 10:28:55,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:55,178 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 176 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:55,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 201 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2024-11-08 10:28:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 13937. [2024-11-08 10:28:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13937 states, 13936 states have (on average 1.2063002296211252) internal successors, (16811), 13936 states have internal predecessors, (16811), 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) [2024-11-08 10:28:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13937 states to 13937 states and 16811 transitions. [2024-11-08 10:28:55,342 INFO L78 Accepts]: Start accepts. Automaton has 13937 states and 16811 transitions. Word has length 207 [2024-11-08 10:28:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:55,342 INFO L471 AbstractCegarLoop]: Abstraction has 13937 states and 16811 transitions. [2024-11-08 10:28:55,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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) [2024-11-08 10:28:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 13937 states and 16811 transitions. [2024-11-08 10:28:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 10:28:55,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:55,356 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:55,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:28:55,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:55,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash -595778739, now seen corresponding path program 1 times [2024-11-08 10:28:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526043963] [2024-11-08 10:28:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 10:28:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526043963] [2024-11-08 10:28:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526043963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:55,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961919176] [2024-11-08 10:28:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:55,607 INFO L87 Difference]: Start difference. First operand 13937 states and 16811 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2024-11-08 10:28:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:56,269 INFO L93 Difference]: Finished difference Result 32978 states and 40133 transitions. [2024-11-08 10:28:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 211 [2024-11-08 10:28:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:56,295 INFO L225 Difference]: With dead ends: 32978 [2024-11-08 10:28:56,295 INFO L226 Difference]: Without dead ends: 19043 [2024-11-08 10:28:56,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:56,310 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:56,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 375 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19043 states. [2024-11-08 10:28:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19043 to 18605. [2024-11-08 10:28:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18605 states, 18604 states have (on average 1.1936680283809933) internal successors, (22207), 18604 states have internal predecessors, (22207), 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) [2024-11-08 10:28:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18605 states to 18605 states and 22207 transitions. [2024-11-08 10:28:56,530 INFO L78 Accepts]: Start accepts. Automaton has 18605 states and 22207 transitions. Word has length 211 [2024-11-08 10:28:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:56,530 INFO L471 AbstractCegarLoop]: Abstraction has 18605 states and 22207 transitions. [2024-11-08 10:28:56,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2024-11-08 10:28:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 18605 states and 22207 transitions. [2024-11-08 10:28:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 10:28:56,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:56,548 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:28:56,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash 278123090, now seen corresponding path program 1 times [2024-11-08 10:28:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:56,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551080995] [2024-11-08 10:28:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:28:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551080995] [2024-11-08 10:28:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551080995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:56,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315415536] [2024-11-08 10:28:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:56,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:28:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:28:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:56,840 INFO L87 Difference]: Start difference. First operand 18605 states and 22207 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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) [2024-11-08 10:28:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:57,900 INFO L93 Difference]: Finished difference Result 37243 states and 44481 transitions. [2024-11-08 10:28:57,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:28:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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 227 [2024-11-08 10:28:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:57,932 INFO L225 Difference]: With dead ends: 37243 [2024-11-08 10:28:57,932 INFO L226 Difference]: Without dead ends: 18640 [2024-11-08 10:28:57,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:57,951 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 446 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:57,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 153 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 10:28:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18640 states. [2024-11-08 10:28:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18640 to 17792. [2024-11-08 10:28:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17792 states, 17791 states have (on average 1.1902085324040246) internal successors, (21175), 17791 states have internal predecessors, (21175), 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) [2024-11-08 10:28:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17792 states to 17792 states and 21175 transitions. [2024-11-08 10:28:58,116 INFO L78 Accepts]: Start accepts. Automaton has 17792 states and 21175 transitions. Word has length 227 [2024-11-08 10:28:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:58,117 INFO L471 AbstractCegarLoop]: Abstraction has 17792 states and 21175 transitions. [2024-11-08 10:28:58,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 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) [2024-11-08 10:28:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 17792 states and 21175 transitions. [2024-11-08 10:28:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-08 10:28:58,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:58,134 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:58,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:28:58,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:58,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2068476313, now seen corresponding path program 1 times [2024-11-08 10:28:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170926291] [2024-11-08 10:28:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 10:28:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170926291] [2024-11-08 10:28:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170926291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:28:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005182304] [2024-11-08 10:28:58,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:58,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:28:58,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:58,401 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) [2024-11-08 10:28:58,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:28:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:58,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:28:58,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:28:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 10:28:58,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:28:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005182304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:58,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:28:58,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:28:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958370451] [2024-11-08 10:28:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:58,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:58,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:58,587 INFO L87 Difference]: Start difference. First operand 17792 states and 21175 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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) [2024-11-08 10:28:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:59,231 INFO L93 Difference]: Finished difference Result 44926 states and 54371 transitions. [2024-11-08 10:28:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 233 [2024-11-08 10:28:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:59,261 INFO L225 Difference]: With dead ends: 44926 [2024-11-08 10:28:59,261 INFO L226 Difference]: Without dead ends: 27136 [2024-11-08 10:28:59,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:28:59,272 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 220 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:59,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 409 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:28:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27136 states. [2024-11-08 10:28:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27136 to 25506. [2024-11-08 10:28:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25506 states, 25505 states have (on average 1.161889825524407) internal successors, (29634), 25505 states have internal predecessors, (29634), 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) [2024-11-08 10:28:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25506 states to 25506 states and 29634 transitions. [2024-11-08 10:28:59,490 INFO L78 Accepts]: Start accepts. Automaton has 25506 states and 29634 transitions. Word has length 233 [2024-11-08 10:28:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:59,490 INFO L471 AbstractCegarLoop]: Abstraction has 25506 states and 29634 transitions. [2024-11-08 10:28:59,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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) [2024-11-08 10:28:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 25506 states and 29634 transitions. [2024-11-08 10:28:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 10:28:59,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:59,508 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:59,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:28:59,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 10:28:59,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1443939385, now seen corresponding path program 1 times [2024-11-08 10:28:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447365267] [2024-11-08 10:28:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 10:29:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447365267] [2024-11-08 10:29:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447365267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125336913] [2024-11-08 10:29:00,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:00,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:00,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:00,092 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) [2024-11-08 10:29:00,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:29:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:00,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:29:00,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-08 10:29:00,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:00,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125336913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:00,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:00,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:29:00,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220104685] [2024-11-08 10:29:00,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:00,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:00,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:00,367 INFO L87 Difference]: Start difference. First operand 25506 states and 29634 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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) [2024-11-08 10:29:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:00,914 INFO L93 Difference]: Finished difference Result 51034 states and 59313 transitions. [2024-11-08 10:29:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:00,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 234 [2024-11-08 10:29:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:00,943 INFO L225 Difference]: With dead ends: 51034 [2024-11-08 10:29:00,943 INFO L226 Difference]: Without dead ends: 25530 [2024-11-08 10:29:00,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:00,962 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:00,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 395 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25530 states. [2024-11-08 10:29:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25530 to 25506. [2024-11-08 10:29:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25506 states, 25505 states have (on average 1.1566359537345619) internal successors, (29500), 25505 states have internal predecessors, (29500), 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) [2024-11-08 10:29:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25506 states to 25506 states and 29500 transitions. [2024-11-08 10:29:01,318 INFO L78 Accepts]: Start accepts. Automaton has 25506 states and 29500 transitions. Word has length 234 [2024-11-08 10:29:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:01,319 INFO L471 AbstractCegarLoop]: Abstraction has 25506 states and 29500 transitions. [2024-11-08 10:29:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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) [2024-11-08 10:29:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 25506 states and 29500 transitions. [2024-11-08 10:29:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 10:29:01,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:01,338 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:01,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:01,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 10:29:01,539 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:01,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:01,540 INFO L85 PathProgramCache]: Analyzing trace with hash -895747558, now seen corresponding path program 1 times [2024-11-08 10:29:01,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:01,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687914875] [2024-11-08 10:29:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:29:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687914875] [2024-11-08 10:29:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687914875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:01,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111816174] [2024-11-08 10:29:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:01,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:01,805 INFO L87 Difference]: Start difference. First operand 25506 states and 29500 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 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) [2024-11-08 10:29:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:02,412 INFO L93 Difference]: Finished difference Result 57351 states and 66689 transitions. [2024-11-08 10:29:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:02,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 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 244 [2024-11-08 10:29:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:02,446 INFO L225 Difference]: With dead ends: 57351 [2024-11-08 10:29:02,446 INFO L226 Difference]: Without dead ends: 31847 [2024-11-08 10:29:02,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:02,466 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:02,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 203 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31847 states. [2024-11-08 10:29:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31847 to 30587. [2024-11-08 10:29:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30587 states, 30586 states have (on average 1.1654024717190872) internal successors, (35645), 30586 states have internal predecessors, (35645), 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) [2024-11-08 10:29:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30587 states to 30587 states and 35645 transitions. [2024-11-08 10:29:02,819 INFO L78 Accepts]: Start accepts. Automaton has 30587 states and 35645 transitions. Word has length 244 [2024-11-08 10:29:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:02,820 INFO L471 AbstractCegarLoop]: Abstraction has 30587 states and 35645 transitions. [2024-11-08 10:29:02,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 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) [2024-11-08 10:29:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30587 states and 35645 transitions. [2024-11-08 10:29:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 10:29:02,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:02,834 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:02,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:29:02,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:02,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1955164033, now seen corresponding path program 1 times [2024-11-08 10:29:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253360069] [2024-11-08 10:29:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:02,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 10:29:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253360069] [2024-11-08 10:29:03,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253360069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036740566] [2024-11-08 10:29:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:03,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:03,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:03,233 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) [2024-11-08 10:29:03,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:29:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:03,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:29:03,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 10:29:03,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:03,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036740566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:03,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:03,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:29:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645849473] [2024-11-08 10:29:03,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:03,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:03,481 INFO L87 Difference]: Start difference. First operand 30587 states and 35645 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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) [2024-11-08 10:29:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:04,413 INFO L93 Difference]: Finished difference Result 87690 states and 101998 transitions. [2024-11-08 10:29:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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 255 [2024-11-08 10:29:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:04,467 INFO L225 Difference]: With dead ends: 87690 [2024-11-08 10:29:04,468 INFO L226 Difference]: Without dead ends: 57105 [2024-11-08 10:29:04,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:04,489 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 533 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:04,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 569 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:29:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57105 states. [2024-11-08 10:29:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57105 to 56664. [2024-11-08 10:29:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56664 states, 56663 states have (on average 1.1598926989393432) internal successors, (65723), 56663 states have internal predecessors, (65723), 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) [2024-11-08 10:29:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56664 states to 56664 states and 65723 transitions. [2024-11-08 10:29:05,160 INFO L78 Accepts]: Start accepts. Automaton has 56664 states and 65723 transitions. Word has length 255 [2024-11-08 10:29:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:05,161 INFO L471 AbstractCegarLoop]: Abstraction has 56664 states and 65723 transitions. [2024-11-08 10:29:05,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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) [2024-11-08 10:29:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 56664 states and 65723 transitions. [2024-11-08 10:29:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-08 10:29:05,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:05,317 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:05,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:29:05,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:05,518 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:05,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash 966697269, now seen corresponding path program 1 times [2024-11-08 10:29:05,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672441647] [2024-11-08 10:29:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:29:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:05,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672441647] [2024-11-08 10:29:05,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672441647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:05,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:05,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963103647] [2024-11-08 10:29:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:05,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:05,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:05,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:05,778 INFO L87 Difference]: Start difference. First operand 56664 states and 65723 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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) [2024-11-08 10:29:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:06,502 INFO L93 Difference]: Finished difference Result 85978 states and 99652 transitions. [2024-11-08 10:29:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:06,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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 257 [2024-11-08 10:29:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:06,529 INFO L225 Difference]: With dead ends: 85978 [2024-11-08 10:29:06,529 INFO L226 Difference]: Without dead ends: 27286 [2024-11-08 10:29:06,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:06,555 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 558 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:06,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 59 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:29:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27286 states. [2024-11-08 10:29:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27286 to 25254. [2024-11-08 10:29:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25254 states, 25253 states have (on average 1.0946422207262503) internal successors, (27643), 25253 states have internal predecessors, (27643), 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) [2024-11-08 10:29:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25254 states to 25254 states and 27643 transitions. [2024-11-08 10:29:06,897 INFO L78 Accepts]: Start accepts. Automaton has 25254 states and 27643 transitions. Word has length 257 [2024-11-08 10:29:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:06,898 INFO L471 AbstractCegarLoop]: Abstraction has 25254 states and 27643 transitions. [2024-11-08 10:29:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 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) [2024-11-08 10:29:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25254 states and 27643 transitions. [2024-11-08 10:29:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-08 10:29:06,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:06,910 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:06,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:29:06,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1530895428, now seen corresponding path program 1 times [2024-11-08 10:29:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334206072] [2024-11-08 10:29:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-08 10:29:07,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:07,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334206072] [2024-11-08 10:29:07,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334206072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:07,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977757362] [2024-11-08 10:29:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:07,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:07,339 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) [2024-11-08 10:29:07,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:29:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:07,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:29:07,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 10:29:07,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977757362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:07,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:07,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:29:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540156271] [2024-11-08 10:29:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:07,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:07,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:07,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:07,657 INFO L87 Difference]: Start difference. First operand 25254 states and 27643 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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) [2024-11-08 10:29:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:08,126 INFO L93 Difference]: Finished difference Result 49700 states and 54438 transitions. [2024-11-08 10:29:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 277 [2024-11-08 10:29:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:08,147 INFO L225 Difference]: With dead ends: 49700 [2024-11-08 10:29:08,148 INFO L226 Difference]: Without dead ends: 24448 [2024-11-08 10:29:08,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:08,165 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 99 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:08,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 271 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:29:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24448 states. [2024-11-08 10:29:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24448 to 24239. [2024-11-08 10:29:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24239 states, 24238 states have (on average 1.091096625134087) internal successors, (26446), 24238 states have internal predecessors, (26446), 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) [2024-11-08 10:29:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24239 states to 24239 states and 26446 transitions. [2024-11-08 10:29:08,390 INFO L78 Accepts]: Start accepts. Automaton has 24239 states and 26446 transitions. Word has length 277 [2024-11-08 10:29:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:08,391 INFO L471 AbstractCegarLoop]: Abstraction has 24239 states and 26446 transitions. [2024-11-08 10:29:08,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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) [2024-11-08 10:29:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 24239 states and 26446 transitions. [2024-11-08 10:29:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-08 10:29:08,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:08,402 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:08,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:08,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 10:29:08,603 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:08,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 647041895, now seen corresponding path program 1 times [2024-11-08 10:29:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:08,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111434118] [2024-11-08 10:29:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:08,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 10:29:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111434118] [2024-11-08 10:29:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111434118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287124078] [2024-11-08 10:29:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:08,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:08,910 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) [2024-11-08 10:29:08,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:29:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:09,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:29:09,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 10:29:09,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287124078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:09,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:29:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418174436] [2024-11-08 10:29:09,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:09,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:09,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:09,129 INFO L87 Difference]: Start difference. First operand 24239 states and 26446 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 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) [2024-11-08 10:29:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:09,771 INFO L93 Difference]: Finished difference Result 70850 states and 77398 transitions. [2024-11-08 10:29:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:09,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 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 293 [2024-11-08 10:29:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:09,815 INFO L225 Difference]: With dead ends: 70850 [2024-11-08 10:29:09,816 INFO L226 Difference]: Without dead ends: 46613 [2024-11-08 10:29:09,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:09,838 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 476 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:09,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 293 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46613 states. [2024-11-08 10:29:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46613 to 41124. [2024-11-08 10:29:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41124 states, 41123 states have (on average 1.0942295066021448) internal successors, (44998), 41123 states have internal predecessors, (44998), 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) [2024-11-08 10:29:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41124 states to 41124 states and 44998 transitions. [2024-11-08 10:29:10,371 INFO L78 Accepts]: Start accepts. Automaton has 41124 states and 44998 transitions. Word has length 293 [2024-11-08 10:29:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 41124 states and 44998 transitions. [2024-11-08 10:29:10,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 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) [2024-11-08 10:29:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 41124 states and 44998 transitions. [2024-11-08 10:29:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-08 10:29:10,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:10,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:10,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:10,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:29:10,593 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:10,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1069010768, now seen corresponding path program 1 times [2024-11-08 10:29:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:10,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79420840] [2024-11-08 10:29:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:11,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79420840] [2024-11-08 10:29:11,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79420840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:11,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:11,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086057900] [2024-11-08 10:29:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:11,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:11,006 INFO L87 Difference]: Start difference. First operand 41124 states and 44998 transitions. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 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) [2024-11-08 10:29:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:11,694 INFO L93 Difference]: Finished difference Result 111935 states and 122482 transitions. [2024-11-08 10:29:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:11,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 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 313 [2024-11-08 10:29:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:11,766 INFO L225 Difference]: With dead ends: 111935 [2024-11-08 10:29:11,766 INFO L226 Difference]: Without dead ends: 70813 [2024-11-08 10:29:11,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:11,802 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 390 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:11,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 398 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70813 states. [2024-11-08 10:29:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70813 to 69780. [2024-11-08 10:29:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69780 states, 69779 states have (on average 1.086000085985755) internal successors, (75780), 69779 states have internal predecessors, (75780), 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) [2024-11-08 10:29:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69780 states to 69780 states and 75780 transitions. [2024-11-08 10:29:12,642 INFO L78 Accepts]: Start accepts. Automaton has 69780 states and 75780 transitions. Word has length 313 [2024-11-08 10:29:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:12,642 INFO L471 AbstractCegarLoop]: Abstraction has 69780 states and 75780 transitions. [2024-11-08 10:29:12,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 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) [2024-11-08 10:29:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 69780 states and 75780 transitions. [2024-11-08 10:29:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-08 10:29:12,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:12,662 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 10:29:12,662 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1827896214, now seen corresponding path program 1 times [2024-11-08 10:29:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104446397] [2024-11-08 10:29:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 10:29:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104446397] [2024-11-08 10:29:13,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104446397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:13,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346865998] [2024-11-08 10:29:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:13,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:13,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:13,201 INFO L87 Difference]: Start difference. First operand 69780 states and 75780 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 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) [2024-11-08 10:29:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:14,186 INFO L93 Difference]: Finished difference Result 146509 states and 158957 transitions. [2024-11-08 10:29:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 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 347 [2024-11-08 10:29:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:14,258 INFO L225 Difference]: With dead ends: 146509 [2024-11-08 10:29:14,258 INFO L226 Difference]: Without dead ends: 73686 [2024-11-08 10:29:14,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:14,298 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 351 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:14,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 89 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:29:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73686 states. [2024-11-08 10:29:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73686 to 71414. [2024-11-08 10:29:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71414 states, 71413 states have (on average 1.0829820900956408) internal successors, (77339), 71413 states have internal predecessors, (77339), 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) [2024-11-08 10:29:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71414 states to 71414 states and 77339 transitions. [2024-11-08 10:29:15,022 INFO L78 Accepts]: Start accepts. Automaton has 71414 states and 77339 transitions. Word has length 347 [2024-11-08 10:29:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:15,022 INFO L471 AbstractCegarLoop]: Abstraction has 71414 states and 77339 transitions. [2024-11-08 10:29:15,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 3 states have internal predecessors, (266), 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) [2024-11-08 10:29:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 71414 states and 77339 transitions. [2024-11-08 10:29:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-08 10:29:15,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:15,252 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:15,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:29:15,252 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:15,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1067620483, now seen corresponding path program 1 times [2024-11-08 10:29:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:15,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321950151] [2024-11-08 10:29:15,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 10:29:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:15,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321950151] [2024-11-08 10:29:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321950151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877133328] [2024-11-08 10:29:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:15,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:15,511 INFO L87 Difference]: Start difference. First operand 71414 states and 77339 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 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) [2024-11-08 10:29:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:16,232 INFO L93 Difference]: Finished difference Result 206100 states and 223317 transitions. [2024-11-08 10:29:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 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 375 [2024-11-08 10:29:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:16,388 INFO L225 Difference]: With dead ends: 206100 [2024-11-08 10:29:16,388 INFO L226 Difference]: Without dead ends: 134688 [2024-11-08 10:29:16,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:16,451 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 173 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:16,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 466 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:29:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134688 states. [2024-11-08 10:29:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134688 to 130815. [2024-11-08 10:29:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130815 states, 130814 states have (on average 1.0834314370021558) internal successors, (141728), 130814 states have internal predecessors, (141728), 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) [2024-11-08 10:29:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130815 states to 130815 states and 141728 transitions. [2024-11-08 10:29:18,150 INFO L78 Accepts]: Start accepts. Automaton has 130815 states and 141728 transitions. Word has length 375 [2024-11-08 10:29:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:18,151 INFO L471 AbstractCegarLoop]: Abstraction has 130815 states and 141728 transitions. [2024-11-08 10:29:18,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 2 states have internal predecessors, (289), 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) [2024-11-08 10:29:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 130815 states and 141728 transitions. [2024-11-08 10:29:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-08 10:29:18,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:18,178 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:18,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 10:29:18,178 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:18,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2020663209, now seen corresponding path program 1 times [2024-11-08 10:29:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:18,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16997877] [2024-11-08 10:29:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 246 proven. 9 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 10:29:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16997877] [2024-11-08 10:29:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16997877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196926579] [2024-11-08 10:29:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:18,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:18,983 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) [2024-11-08 10:29:18,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:29:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:19,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:29:19,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 10:29:19,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:19,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196926579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:19,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:19,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 10:29:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308726653] [2024-11-08 10:29:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:19,336 INFO L87 Difference]: Start difference. First operand 130815 states and 141728 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2024-11-08 10:29:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:20,357 INFO L93 Difference]: Finished difference Result 258414 states and 280014 transitions. [2024-11-08 10:29:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 398 [2024-11-08 10:29:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:20,506 INFO L225 Difference]: With dead ends: 258414 [2024-11-08 10:29:20,506 INFO L226 Difference]: Without dead ends: 127601 [2024-11-08 10:29:20,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:20,597 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 209 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:20,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 336 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:29:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127601 states. [2024-11-08 10:29:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127601 to 121875. [2024-11-08 10:29:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121875 states, 121874 states have (on average 1.077859100382362) internal successors, (131363), 121874 states have internal predecessors, (131363), 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) [2024-11-08 10:29:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121875 states to 121875 states and 131363 transitions. [2024-11-08 10:29:22,167 INFO L78 Accepts]: Start accepts. Automaton has 121875 states and 131363 transitions. Word has length 398 [2024-11-08 10:29:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:22,168 INFO L471 AbstractCegarLoop]: Abstraction has 121875 states and 131363 transitions. [2024-11-08 10:29:22,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2024-11-08 10:29:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 121875 states and 131363 transitions. [2024-11-08 10:29:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-08 10:29:22,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:22,190 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:22,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 10:29:22,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:22,391 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:22,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1278796474, now seen corresponding path program 1 times [2024-11-08 10:29:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10051716] [2024-11-08 10:29:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 10:29:22,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10051716] [2024-11-08 10:29:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10051716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:22,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459305041] [2024-11-08 10:29:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:22,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:22,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:22,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:22,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:22,808 INFO L87 Difference]: Start difference. First operand 121875 states and 131363 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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) [2024-11-08 10:29:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:23,590 INFO L93 Difference]: Finished difference Result 225443 states and 242438 transitions. [2024-11-08 10:29:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:23,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 400 [2024-11-08 10:29:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:23,700 INFO L225 Difference]: With dead ends: 225443 [2024-11-08 10:29:23,700 INFO L226 Difference]: Without dead ends: 94841 [2024-11-08 10:29:23,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:23,771 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 158 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:23,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 291 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:29:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94841 states. [2024-11-08 10:29:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94841 to 85692. [2024-11-08 10:29:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85692 states, 85691 states have (on average 1.0591544036129816) internal successors, (90760), 85691 states have internal predecessors, (90760), 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) [2024-11-08 10:29:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85692 states to 85692 states and 90760 transitions. [2024-11-08 10:29:25,542 INFO L78 Accepts]: Start accepts. Automaton has 85692 states and 90760 transitions. Word has length 400 [2024-11-08 10:29:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:25,542 INFO L471 AbstractCegarLoop]: Abstraction has 85692 states and 90760 transitions. [2024-11-08 10:29:25,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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) [2024-11-08 10:29:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 85692 states and 90760 transitions. [2024-11-08 10:29:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-08 10:29:25,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:25,554 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:25,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 10:29:25,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:25,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -262900740, now seen corresponding path program 1 times [2024-11-08 10:29:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136570368] [2024-11-08 10:29:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 10:29:25,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:25,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136570368] [2024-11-08 10:29:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136570368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:25,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581707826] [2024-11-08 10:29:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:25,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:29:25,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:29:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:25,867 INFO L87 Difference]: Start difference. First operand 85692 states and 90760 transitions. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 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) [2024-11-08 10:29:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:26,703 INFO L93 Difference]: Finished difference Result 172631 states and 182842 transitions. [2024-11-08 10:29:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:29:26,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 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 409 [2024-11-08 10:29:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:26,795 INFO L225 Difference]: With dead ends: 172631 [2024-11-08 10:29:26,795 INFO L226 Difference]: Without dead ends: 82069 [2024-11-08 10:29:26,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:29:26,842 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 426 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:26,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 43 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:29:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82069 states. [2024-11-08 10:29:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82069 to 61890. [2024-11-08 10:29:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61890 states, 61889 states have (on average 1.051026838371924) internal successors, (65047), 61889 states have internal predecessors, (65047), 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) [2024-11-08 10:29:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61890 states to 61890 states and 65047 transitions. [2024-11-08 10:29:27,749 INFO L78 Accepts]: Start accepts. Automaton has 61890 states and 65047 transitions. Word has length 409 [2024-11-08 10:29:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:27,749 INFO L471 AbstractCegarLoop]: Abstraction has 61890 states and 65047 transitions. [2024-11-08 10:29:27,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 3 states have internal predecessors, (376), 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) [2024-11-08 10:29:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 61890 states and 65047 transitions. [2024-11-08 10:29:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-11-08 10:29:27,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:27,758 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:27,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 10:29:27,758 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:27,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1556280656, now seen corresponding path program 1 times [2024-11-08 10:29:27,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:27,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775355448] [2024-11-08 10:29:27,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:27,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 362 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 10:29:28,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:28,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775355448] [2024-11-08 10:29:28,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775355448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:28,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323788280] [2024-11-08 10:29:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:28,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:28,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:28,474 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) [2024-11-08 10:29:28,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:29:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:28,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:29:28,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 10:29:28,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323788280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:28,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 10:29:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316625047] [2024-11-08 10:29:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:28,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:28,837 INFO L87 Difference]: Start difference. First operand 61890 states and 65047 transitions. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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) [2024-11-08 10:29:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:29,501 INFO L93 Difference]: Finished difference Result 120534 states and 126541 transitions. [2024-11-08 10:29:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:29,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 417 [2024-11-08 10:29:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:29,566 INFO L225 Difference]: With dead ends: 120534 [2024-11-08 10:29:29,566 INFO L226 Difference]: Without dead ends: 53774 [2024-11-08 10:29:29,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:29,609 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 139 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:29,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 324 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:29:29,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53774 states. [2024-11-08 10:29:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53774 to 51315. [2024-11-08 10:29:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51315 states, 51314 states have (on average 1.0490899169817205) internal successors, (53833), 51314 states have internal predecessors, (53833), 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) [2024-11-08 10:29:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51315 states to 51315 states and 53833 transitions. [2024-11-08 10:29:30,379 INFO L78 Accepts]: Start accepts. Automaton has 51315 states and 53833 transitions. Word has length 417 [2024-11-08 10:29:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:30,380 INFO L471 AbstractCegarLoop]: Abstraction has 51315 states and 53833 transitions. [2024-11-08 10:29:30,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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) [2024-11-08 10:29:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 51315 states and 53833 transitions. [2024-11-08 10:29:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-11-08 10:29:30,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:30,387 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:30,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:30,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:30,588 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:30,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 432053290, now seen corresponding path program 1 times [2024-11-08 10:29:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:30,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683211469] [2024-11-08 10:29:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:30,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 10:29:30,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:30,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683211469] [2024-11-08 10:29:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683211469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:30,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218945119] [2024-11-08 10:29:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:30,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:30,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:30,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:30,920 INFO L87 Difference]: Start difference. First operand 51315 states and 53833 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-11-08 10:29:31,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:31,639 INFO L93 Difference]: Finished difference Result 103846 states and 108888 transitions. [2024-11-08 10:29:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 421 [2024-11-08 10:29:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:31,696 INFO L225 Difference]: With dead ends: 103846 [2024-11-08 10:29:31,697 INFO L226 Difference]: Without dead ends: 52533 [2024-11-08 10:29:31,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:31,733 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 153 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:31,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 315 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:29:31,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52533 states. [2024-11-08 10:29:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52533 to 51315. [2024-11-08 10:29:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51315 states, 51314 states have (on average 1.046069298826831) internal successors, (53678), 51314 states have internal predecessors, (53678), 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) [2024-11-08 10:29:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51315 states to 51315 states and 53678 transitions. [2024-11-08 10:29:32,199 INFO L78 Accepts]: Start accepts. Automaton has 51315 states and 53678 transitions. Word has length 421 [2024-11-08 10:29:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:32,199 INFO L471 AbstractCegarLoop]: Abstraction has 51315 states and 53678 transitions. [2024-11-08 10:29:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2024-11-08 10:29:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 51315 states and 53678 transitions. [2024-11-08 10:29:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-08 10:29:32,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:32,208 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 10:29:32,208 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:32,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1585525713, now seen corresponding path program 1 times [2024-11-08 10:29:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:32,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48391622] [2024-11-08 10:29:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-08 10:29:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48391622] [2024-11-08 10:29:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48391622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704420364] [2024-11-08 10:29:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:32,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:32,814 INFO L87 Difference]: Start difference. First operand 51315 states and 53678 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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) [2024-11-08 10:29:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:33,319 INFO L93 Difference]: Finished difference Result 105673 states and 110492 transitions. [2024-11-08 10:29:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 455 [2024-11-08 10:29:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:33,373 INFO L225 Difference]: With dead ends: 105673 [2024-11-08 10:29:33,373 INFO L226 Difference]: Without dead ends: 53544 [2024-11-08 10:29:33,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:33,407 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 154 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:33,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 316 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:29:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53544 states. [2024-11-08 10:29:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53544 to 52930. [2024-11-08 10:29:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52930 states, 52929 states have (on average 1.0450414706493605) internal successors, (55313), 52929 states have internal predecessors, (55313), 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) [2024-11-08 10:29:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52930 states to 52930 states and 55313 transitions. [2024-11-08 10:29:34,303 INFO L78 Accepts]: Start accepts. Automaton has 52930 states and 55313 transitions. Word has length 455 [2024-11-08 10:29:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:34,303 INFO L471 AbstractCegarLoop]: Abstraction has 52930 states and 55313 transitions. [2024-11-08 10:29:34,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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) [2024-11-08 10:29:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 52930 states and 55313 transitions. [2024-11-08 10:29:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-11-08 10:29:34,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:34,316 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:34,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 10:29:34,316 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:34,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1160797929, now seen corresponding path program 1 times [2024-11-08 10:29:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:34,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268292379] [2024-11-08 10:29:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 450 proven. 158 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 10:29:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268292379] [2024-11-08 10:29:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268292379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816372449] [2024-11-08 10:29:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:34,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:34,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:34,940 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) [2024-11-08 10:29:34,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:29:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:35,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:29:35,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-08 10:29:35,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816372449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:35,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:35,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 10:29:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650321779] [2024-11-08 10:29:35,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:35,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:35,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:35,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:35,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:35,169 INFO L87 Difference]: Start difference. First operand 52930 states and 55313 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2024-11-08 10:29:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:35,488 INFO L93 Difference]: Finished difference Result 108902 states and 113607 transitions. [2024-11-08 10:29:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:35,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 462 [2024-11-08 10:29:35,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:35,540 INFO L225 Difference]: With dead ends: 108902 [2024-11-08 10:29:35,541 INFO L226 Difference]: Without dead ends: 51301 [2024-11-08 10:29:35,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:35,573 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 205 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:35,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 663 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:29:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51301 states. [2024-11-08 10:29:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51301 to 49671. [2024-11-08 10:29:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49671 states, 49670 states have (on average 1.040386551238172) internal successors, (51676), 49670 states have internal predecessors, (51676), 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) [2024-11-08 10:29:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49671 states to 49671 states and 51676 transitions. [2024-11-08 10:29:36,134 INFO L78 Accepts]: Start accepts. Automaton has 49671 states and 51676 transitions. Word has length 462 [2024-11-08 10:29:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:36,135 INFO L471 AbstractCegarLoop]: Abstraction has 49671 states and 51676 transitions. [2024-11-08 10:29:36,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2024-11-08 10:29:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 49671 states and 51676 transitions. [2024-11-08 10:29:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-11-08 10:29:36,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:36,144 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:36,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:36,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-08 10:29:36,345 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:36,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -848125226, now seen corresponding path program 1 times [2024-11-08 10:29:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387088199] [2024-11-08 10:29:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-08 10:29:37,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387088199] [2024-11-08 10:29:37,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387088199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:37,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27273026] [2024-11-08 10:29:37,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:37,064 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) [2024-11-08 10:29:37,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 10:29:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:37,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:29:37,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 10:29:37,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:37,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27273026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:37,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:37,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:29:37,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871008968] [2024-11-08 10:29:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:37,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:37,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:37,529 INFO L87 Difference]: Start difference. First operand 49671 states and 51676 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2024-11-08 10:29:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:38,154 INFO L93 Difference]: Finished difference Result 91182 states and 94870 transitions. [2024-11-08 10:29:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 482 [2024-11-08 10:29:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:38,194 INFO L225 Difference]: With dead ends: 91182 [2024-11-08 10:29:38,194 INFO L226 Difference]: Without dead ends: 41513 [2024-11-08 10:29:38,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:38,217 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 150 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:38,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 302 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:29:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41513 states. [2024-11-08 10:29:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41513 to 38265. [2024-11-08 10:29:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38265 states, 38264 states have (on average 1.0374242107463936) internal successors, (39696), 38264 states have internal predecessors, (39696), 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) [2024-11-08 10:29:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38265 states to 38265 states and 39696 transitions. [2024-11-08 10:29:38,712 INFO L78 Accepts]: Start accepts. Automaton has 38265 states and 39696 transitions. Word has length 482 [2024-11-08 10:29:38,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:38,712 INFO L471 AbstractCegarLoop]: Abstraction has 38265 states and 39696 transitions. [2024-11-08 10:29:38,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2024-11-08 10:29:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 38265 states and 39696 transitions. [2024-11-08 10:29:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-11-08 10:29:38,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:38,721 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:38,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:38,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 10:29:38,922 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:38,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash 68698594, now seen corresponding path program 1 times [2024-11-08 10:29:38,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:38,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230719828] [2024-11-08 10:29:38,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 510 proven. 158 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 10:29:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230719828] [2024-11-08 10:29:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230719828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712872561] [2024-11-08 10:29:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:39,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:39,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:39,460 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) [2024-11-08 10:29:39,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 10:29:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:39,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:29:39,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-08 10:29:39,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:39,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712872561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:39,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:39,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-08 10:29:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601804652] [2024-11-08 10:29:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:39,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:39,703 INFO L87 Difference]: Start difference. First operand 38265 states and 39696 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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) [2024-11-08 10:29:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:39,966 INFO L93 Difference]: Finished difference Result 103161 states and 107047 transitions. [2024-11-08 10:29:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:39,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 482 [2024-11-08 10:29:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:40,032 INFO L225 Difference]: With dead ends: 103161 [2024-11-08 10:29:40,032 INFO L226 Difference]: Without dead ends: 62868 [2024-11-08 10:29:40,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:29:40,063 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 207 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:40,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 711 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:29:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62868 states. [2024-11-08 10:29:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62868 to 61851. [2024-11-08 10:29:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61851 states, 61850 states have (on average 1.0346321746160065) internal successors, (63992), 61850 states have internal predecessors, (63992), 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) [2024-11-08 10:29:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61851 states to 61851 states and 63992 transitions. [2024-11-08 10:29:40,686 INFO L78 Accepts]: Start accepts. Automaton has 61851 states and 63992 transitions. Word has length 482 [2024-11-08 10:29:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:40,687 INFO L471 AbstractCegarLoop]: Abstraction has 61851 states and 63992 transitions. [2024-11-08 10:29:40,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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) [2024-11-08 10:29:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 61851 states and 63992 transitions. [2024-11-08 10:29:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-11-08 10:29:40,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:40,699 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:29:40,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 10:29:40,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 10:29:40,901 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:40,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:40,901 INFO L85 PathProgramCache]: Analyzing trace with hash -109876325, now seen corresponding path program 1 times [2024-11-08 10:29:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:40,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974535777] [2024-11-08 10:29:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 483 proven. 178 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 10:29:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974535777] [2024-11-08 10:29:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974535777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:29:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324675374] [2024-11-08 10:29:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:41,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:29:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:41,432 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) [2024-11-08 10:29:41,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 10:29:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:41,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:29:41,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:29:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 10:29:41,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:29:41,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324675374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:41,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:29:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 10:29:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043412874] [2024-11-08 10:29:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:41,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:41,707 INFO L87 Difference]: Start difference. First operand 61851 states and 63992 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2024-11-08 10:29:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:42,248 INFO L93 Difference]: Finished difference Result 123294 states and 127566 transitions. [2024-11-08 10:29:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:42,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 483 [2024-11-08 10:29:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:42,310 INFO L225 Difference]: With dead ends: 123294 [2024-11-08 10:29:42,310 INFO L226 Difference]: Without dead ends: 61039 [2024-11-08 10:29:42,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:29:42,350 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 155 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:42,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 69 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:29:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61039 states.