./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2c3b1a53bc376cbb6283db57f6430d0a17b3acc99aa70ab198c7c36e6e59ecc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:24:46,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:24:46,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:24:46,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:24:46,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:24:46,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:24:46,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:24:46,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:24:46,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:24:46,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:24:46,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:24:46,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:24:46,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:24:46,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:24:46,383 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:24:46,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:24:46,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:24:46,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:24:46,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:24:46,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:24:46,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:24:46,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:24:46,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:24:46,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:24:46,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:24:46,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:24:46,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:24:46,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 2c3b1a53bc376cbb6283db57f6430d0a17b3acc99aa70ab198c7c36e6e59ecc9 [2025-01-09 04:24:46,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:24:46,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:24:46,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:24:46,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:24:46,687 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:24:46,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2025-01-09 04:24:47,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6722b2650/ba75c51ffbf74f28a1dfa73fdfa22d03/FLAGd6e8dd073 [2025-01-09 04:24:48,216 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:24:48,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2025-01-09 04:24:48,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6722b2650/ba75c51ffbf74f28a1dfa73fdfa22d03/FLAGd6e8dd073 [2025-01-09 04:24:48,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6722b2650/ba75c51ffbf74f28a1dfa73fdfa22d03 [2025-01-09 04:24:48,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:24:48,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:24:48,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:24:48,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:24:48,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:24:48,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c75793e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48, skipping insertion in model container [2025-01-09 04:24:48,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:24:48,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c[11270,11283] [2025-01-09 04:24:48,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:24:48,515 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:24:48,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c[11270,11283] [2025-01-09 04:24:48,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:24:48,568 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:24:48,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48 WrapperNode [2025-01-09 04:24:48,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:24:48,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:24:48,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:24:48,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:24:48,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,606 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 336 [2025-01-09 04:24:48,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:24:48,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:24:48,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:24:48,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:24:48,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,638 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]. [2025-01-09 04:24:48,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:24:48,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:24:48,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:24:48,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:24:48,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (1/1) ... [2025-01-09 04:24:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:24:48,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:24:48,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:24:48,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:24:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:24:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:24:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:24:48,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:24:48,820 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:24:48,821 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:24:49,178 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-01-09 04:24:49,178 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:24:49,190 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:24:49,191 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:24:49,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:49 BoogieIcfgContainer [2025-01-09 04:24:49,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:24:49,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:24:49,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:24:49,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:24:49,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:24:48" (1/3) ... [2025-01-09 04:24:49,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f023053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:49, skipping insertion in model container [2025-01-09 04:24:49,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:24:48" (2/3) ... [2025-01-09 04:24:49,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f023053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:24:49, skipping insertion in model container [2025-01-09 04:24:49,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:24:49" (3/3) ... [2025-01-09 04:24:49,201 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2025-01-09 04:24:49,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:24:49,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c that has 1 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:24:49,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:24:49,274 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;@1ef4acfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:24:49,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:24:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.75) internal successors, (140), 81 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 04:24:49,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:49,286 INFO L218 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] [2025-01-09 04:24:49,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:49,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -480610703, now seen corresponding path program 1 times [2025-01-09 04:24:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178155020] [2025-01-09 04:24:49,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:49,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 04:24:49,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 04:24:49,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:49,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:49,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178155020] [2025-01-09 04:24:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178155020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:24:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418765121] [2025-01-09 04:24:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:49,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:24:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:49,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:24:49,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:24:49,513 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.75) internal successors, (140), 81 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:49,531 INFO L93 Difference]: Finished difference Result 128 states and 212 transitions. [2025-01-09 04:24:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:24:49,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-01-09 04:24:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:49,537 INFO L225 Difference]: With dead ends: 128 [2025-01-09 04:24:49,537 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 04:24:49,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:24:49,541 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:49,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 04:24:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 04:24:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2025-01-09 04:24:49,567 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 23 [2025-01-09 04:24:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:49,568 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2025-01-09 04:24:49,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2025-01-09 04:24:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 04:24:49,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:49,570 INFO L218 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] [2025-01-09 04:24:49,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:24:49,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:49,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1820211887, now seen corresponding path program 1 times [2025-01-09 04:24:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557957147] [2025-01-09 04:24:49,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:49,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 04:24:49,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 04:24:49,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:49,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:49,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557957147] [2025-01-09 04:24:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557957147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:24:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192153792] [2025-01-09 04:24:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:49,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:24:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:49,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:24:49,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:49,857 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:49,952 INFO L93 Difference]: Finished difference Result 125 states and 206 transitions. [2025-01-09 04:24:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:24:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-01-09 04:24:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:49,954 INFO L225 Difference]: With dead ends: 125 [2025-01-09 04:24:49,954 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 04:24:49,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:24:49,955 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:49,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 04:24:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 04:24:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2025-01-09 04:24:49,963 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 23 [2025-01-09 04:24:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:49,963 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2025-01-09 04:24:49,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2025-01-09 04:24:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:24:49,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:49,966 INFO L218 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] [2025-01-09 04:24:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:24:49,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:49,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1185647654, now seen corresponding path program 1 times [2025-01-09 04:24:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:49,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552159390] [2025-01-09 04:24:49,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:49,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:24:50,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:24:50,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:50,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552159390] [2025-01-09 04:24:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552159390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:24:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499142149] [2025-01-09 04:24:50,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:50,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:24:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:50,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:24:50,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:24:50,240 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:50,523 INFO L93 Difference]: Finished difference Result 499 states and 774 transitions. [2025-01-09 04:24:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:24:50,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 04:24:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:50,531 INFO L225 Difference]: With dead ends: 499 [2025-01-09 04:24:50,531 INFO L226 Difference]: Without dead ends: 457 [2025-01-09 04:24:50,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:24:50,533 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 751 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:50,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1200 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-09 04:24:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 119. [2025-01-09 04:24:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 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) [2025-01-09 04:24:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-01-09 04:24:50,554 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 53 [2025-01-09 04:24:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:50,554 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-01-09 04:24:50,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-01-09 04:24:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:24:50,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:50,556 INFO L218 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] [2025-01-09 04:24:50,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:24:50,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash -174634986, now seen corresponding path program 1 times [2025-01-09 04:24:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727554533] [2025-01-09 04:24:50,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:50,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:50,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:24:50,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:24:50,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:50,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727554533] [2025-01-09 04:24:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727554533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:50,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823270022] [2025-01-09 04:24:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:50,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:50,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:50,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:50,663 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:50,682 INFO L93 Difference]: Finished difference Result 272 states and 411 transitions. [2025-01-09 04:24:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 04:24:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:50,684 INFO L225 Difference]: With dead ends: 272 [2025-01-09 04:24:50,684 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 04:24:50,685 INFO L434 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 [2025-01-09 04:24:50,686 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:50,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 163 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 04:24:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-01-09 04:24:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (276), 187 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 276 transitions. [2025-01-09 04:24:50,702 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 276 transitions. Word has length 55 [2025-01-09 04:24:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:50,703 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 276 transitions. [2025-01-09 04:24:50,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 276 transitions. [2025-01-09 04:24:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:24:50,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:50,705 INFO L218 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] [2025-01-09 04:24:50,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:24:50,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:50,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash -108141474, now seen corresponding path program 1 times [2025-01-09 04:24:50,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:50,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651611789] [2025-01-09 04:24:50,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:50,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:24:50,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:24:50,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:50,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:51,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651611789] [2025-01-09 04:24:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651611789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:51,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:51,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:24:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052869698] [2025-01-09 04:24:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:51,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:24:51,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:51,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:24:51,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:24:51,055 INFO L87 Difference]: Start difference. First operand 188 states and 276 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:51,259 INFO L93 Difference]: Finished difference Result 341 states and 516 transitions. [2025-01-09 04:24:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:24:51,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 04:24:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:51,261 INFO L225 Difference]: With dead ends: 341 [2025-01-09 04:24:51,261 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 04:24:51,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:24:51,263 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 70 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:51,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 417 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 04:24:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-01-09 04:24:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.46524064171123) internal successors, (274), 187 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 274 transitions. [2025-01-09 04:24:51,281 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 274 transitions. Word has length 55 [2025-01-09 04:24:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:51,282 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 274 transitions. [2025-01-09 04:24:51,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 274 transitions. [2025-01-09 04:24:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:24:51,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:51,283 INFO L218 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] [2025-01-09 04:24:51,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:24:51,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:51,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash 527858515, now seen corresponding path program 1 times [2025-01-09 04:24:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:51,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845261858] [2025-01-09 04:24:51,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:24:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:24:51,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:51,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845261858] [2025-01-09 04:24:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845261858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:51,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053625739] [2025-01-09 04:24:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:51,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:51,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:51,590 INFO L87 Difference]: Start difference. First operand 188 states and 274 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:51,637 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-01-09 04:24:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:51,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 04:24:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:51,639 INFO L225 Difference]: With dead ends: 196 [2025-01-09 04:24:51,639 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 04:24:51,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:51,640 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:51,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 04:24:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-09 04:24:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2025-01-09 04:24:51,652 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 56 [2025-01-09 04:24:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:51,652 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2025-01-09 04:24:51,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2025-01-09 04:24:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:24:51,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:51,654 INFO L218 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] [2025-01-09 04:24:51,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:24:51,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash -178952226, now seen corresponding path program 1 times [2025-01-09 04:24:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059901290] [2025-01-09 04:24:51,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:51,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:24:51,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:24:51,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:51,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:51,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:51,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059901290] [2025-01-09 04:24:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059901290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:51,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:51,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684437754] [2025-01-09 04:24:51,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:51,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:51,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:51,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:51,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:51,756 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:51,776 INFO L93 Difference]: Finished difference Result 492 states and 735 transitions. [2025-01-09 04:24:51,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:51,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 04:24:51,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:51,778 INFO L225 Difference]: With dead ends: 492 [2025-01-09 04:24:51,778 INFO L226 Difference]: Without dead ends: 335 [2025-01-09 04:24:51,779 INFO L434 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 [2025-01-09 04:24:51,779 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:51,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 222 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-09 04:24:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2025-01-09 04:24:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.4698795180722892) internal successors, (488), 332 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 488 transitions. [2025-01-09 04:24:51,790 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 488 transitions. Word has length 57 [2025-01-09 04:24:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 488 transitions. [2025-01-09 04:24:51,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 488 transitions. [2025-01-09 04:24:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:24:51,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:51,791 INFO L218 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] [2025-01-09 04:24:51,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:24:51,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:51,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:51,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1059309790, now seen corresponding path program 1 times [2025-01-09 04:24:51,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:51,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224436658] [2025-01-09 04:24:51,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:24:51,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:24:51,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224436658] [2025-01-09 04:24:51,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224436658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507089259] [2025-01-09 04:24:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:51,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:51,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:51,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:51,871 INFO L87 Difference]: Start difference. First operand 333 states and 488 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:51,891 INFO L93 Difference]: Finished difference Result 893 states and 1334 transitions. [2025-01-09 04:24:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:51,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 04:24:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:51,894 INFO L225 Difference]: With dead ends: 893 [2025-01-09 04:24:51,894 INFO L226 Difference]: Without dead ends: 597 [2025-01-09 04:24:51,895 INFO L434 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 [2025-01-09 04:24:51,895 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 53 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:51,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-01-09 04:24:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2025-01-09 04:24:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4713804713804715) internal successors, (874), 594 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 874 transitions. [2025-01-09 04:24:51,915 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 874 transitions. Word has length 57 [2025-01-09 04:24:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:51,915 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 874 transitions. [2025-01-09 04:24:51,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 874 transitions. [2025-01-09 04:24:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:24:51,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:51,916 INFO L218 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] [2025-01-09 04:24:51,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:24:51,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:51,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1156159010, now seen corresponding path program 1 times [2025-01-09 04:24:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:51,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949909745] [2025-01-09 04:24:51,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:51,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:24:51,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:24:51,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:51,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:51,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949909745] [2025-01-09 04:24:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949909745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:51,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640449841] [2025-01-09 04:24:51,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:51,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:51,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:51,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:51,985 INFO L87 Difference]: Start difference. First operand 595 states and 874 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:52,018 INFO L93 Difference]: Finished difference Result 1647 states and 2436 transitions. [2025-01-09 04:24:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:52,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 04:24:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:52,024 INFO L225 Difference]: With dead ends: 1647 [2025-01-09 04:24:52,024 INFO L226 Difference]: Without dead ends: 1089 [2025-01-09 04:24:52,025 INFO L434 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 [2025-01-09 04:24:52,028 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 51 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:52,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-01-09 04:24:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1087. [2025-01-09 04:24:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4567219152854511) internal successors, (1582), 1086 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1582 transitions. [2025-01-09 04:24:52,081 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1582 transitions. Word has length 57 [2025-01-09 04:24:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:52,081 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1582 transitions. [2025-01-09 04:24:52,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1582 transitions. [2025-01-09 04:24:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:24:52,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:52,082 INFO L218 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] [2025-01-09 04:24:52,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:24:52,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:52,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash 624773854, now seen corresponding path program 1 times [2025-01-09 04:24:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952361734] [2025-01-09 04:24:52,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:52,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:52,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:24:52,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:24:52,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:52,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952361734] [2025-01-09 04:24:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952361734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194035571] [2025-01-09 04:24:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:52,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:52,164 INFO L87 Difference]: Start difference. First operand 1087 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:52,210 INFO L93 Difference]: Finished difference Result 3059 states and 4448 transitions. [2025-01-09 04:24:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:52,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 04:24:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:52,219 INFO L225 Difference]: With dead ends: 3059 [2025-01-09 04:24:52,219 INFO L226 Difference]: Without dead ends: 2009 [2025-01-09 04:24:52,221 INFO L434 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 [2025-01-09 04:24:52,222 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 49 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:52,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2025-01-09 04:24:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2007. [2025-01-09 04:24:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 2006 states have (on average 1.4307078763708874) internal successors, (2870), 2006 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2870 transitions. [2025-01-09 04:24:52,290 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2870 transitions. Word has length 57 [2025-01-09 04:24:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:52,290 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 2870 transitions. [2025-01-09 04:24:52,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2870 transitions. [2025-01-09 04:24:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:24:52,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:52,291 INFO L218 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] [2025-01-09 04:24:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:24:52,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash -442808610, now seen corresponding path program 1 times [2025-01-09 04:24:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975450017] [2025-01-09 04:24:52,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:52,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:24:52,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:24:52,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:52,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:52,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975450017] [2025-01-09 04:24:52,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975450017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:52,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160102461] [2025-01-09 04:24:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:52,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:52,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:52,345 INFO L87 Difference]: Start difference. First operand 2007 states and 2870 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:52,402 INFO L93 Difference]: Finished difference Result 4125 states and 5947 transitions. [2025-01-09 04:24:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 04:24:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:52,414 INFO L225 Difference]: With dead ends: 4125 [2025-01-09 04:24:52,414 INFO L226 Difference]: Without dead ends: 3003 [2025-01-09 04:24:52,417 INFO L434 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 [2025-01-09 04:24:52,417 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:52,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2025-01-09 04:24:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 3001. [2025-01-09 04:24:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 3000 states have (on average 1.4213333333333333) internal successors, (4264), 3000 states have internal predecessors, (4264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4264 transitions. [2025-01-09 04:24:52,537 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4264 transitions. Word has length 57 [2025-01-09 04:24:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:52,537 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 4264 transitions. [2025-01-09 04:24:52,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4264 transitions. [2025-01-09 04:24:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:24:52,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:52,540 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:52,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:24:52,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:52,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash 279128926, now seen corresponding path program 1 times [2025-01-09 04:24:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:52,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307624814] [2025-01-09 04:24:52,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:52,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:24:52,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:24:52,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:52,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:24:52,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:52,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307624814] [2025-01-09 04:24:52,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307624814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:52,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:52,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:24:52,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684166972] [2025-01-09 04:24:52,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:52,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:24:52,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:52,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:24:52,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:24:52,716 INFO L87 Difference]: Start difference. First operand 3001 states and 4264 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:53,089 INFO L93 Difference]: Finished difference Result 18453 states and 26254 transitions. [2025-01-09 04:24:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:24:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 76 [2025-01-09 04:24:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:53,150 INFO L225 Difference]: With dead ends: 18453 [2025-01-09 04:24:53,150 INFO L226 Difference]: Without dead ends: 15491 [2025-01-09 04:24:53,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:24:53,159 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 553 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:53,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 726 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15491 states. [2025-01-09 04:24:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15491 to 5961. [2025-01-09 04:24:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5961 states, 5960 states have (on average 1.4161073825503356) internal successors, (8440), 5960 states have internal predecessors, (8440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 8440 transitions. [2025-01-09 04:24:53,452 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 8440 transitions. Word has length 76 [2025-01-09 04:24:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:53,452 INFO L471 AbstractCegarLoop]: Abstraction has 5961 states and 8440 transitions. [2025-01-09 04:24:53,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 8440 transitions. [2025-01-09 04:24:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:24:53,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:53,458 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:53,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:24:53,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:53,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1517390942, now seen corresponding path program 1 times [2025-01-09 04:24:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872405834] [2025-01-09 04:24:53,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:53,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:53,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:24:53,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:24:53,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:53,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:24:53,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:53,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872405834] [2025-01-09 04:24:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872405834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:53,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:53,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:24:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618308652] [2025-01-09 04:24:53,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:53,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:24:53,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:53,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:24:53,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:24:53,643 INFO L87 Difference]: Start difference. First operand 5961 states and 8440 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:54,161 INFO L93 Difference]: Finished difference Result 21413 states and 30430 transitions. [2025-01-09 04:24:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:24:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:24:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:54,216 INFO L225 Difference]: With dead ends: 21413 [2025-01-09 04:24:54,216 INFO L226 Difference]: Without dead ends: 18451 [2025-01-09 04:24:54,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:24:54,226 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 573 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:54,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 682 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18451 states. [2025-01-09 04:24:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18451 to 10409. [2025-01-09 04:24:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10409 states, 10408 states have (on average 1.4089162182936203) internal successors, (14664), 10408 states have internal predecessors, (14664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 14664 transitions. [2025-01-09 04:24:54,680 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 14664 transitions. Word has length 76 [2025-01-09 04:24:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:54,680 INFO L471 AbstractCegarLoop]: Abstraction has 10409 states and 14664 transitions. [2025-01-09 04:24:54,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 14664 transitions. [2025-01-09 04:24:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:24:54,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:54,683 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:54,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:24:54,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:54,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash -698077858, now seen corresponding path program 1 times [2025-01-09 04:24:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093655732] [2025-01-09 04:24:54,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:54,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:24:54,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:24:54,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:54,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:24:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:54,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093655732] [2025-01-09 04:24:54,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093655732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:54,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:24:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653029691] [2025-01-09 04:24:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:24:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:54,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:24:54,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:24:54,836 INFO L87 Difference]: Start difference. First operand 10409 states and 14664 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:55,365 INFO L93 Difference]: Finished difference Result 24373 states and 34606 transitions. [2025-01-09 04:24:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:24:55,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 76 [2025-01-09 04:24:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:55,413 INFO L225 Difference]: With dead ends: 24373 [2025-01-09 04:24:55,413 INFO L226 Difference]: Without dead ends: 21411 [2025-01-09 04:24:55,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:24:55,422 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 611 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:55,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 673 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21411 states. [2025-01-09 04:24:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21411 to 13369. [2025-01-09 04:24:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13369 states, 13368 states have (on average 1.4093357271095153) internal successors, (18840), 13368 states have internal predecessors, (18840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 18840 transitions. [2025-01-09 04:24:55,984 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 18840 transitions. Word has length 76 [2025-01-09 04:24:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:55,984 INFO L471 AbstractCegarLoop]: Abstraction has 13369 states and 18840 transitions. [2025-01-09 04:24:55,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 18840 transitions. [2025-01-09 04:24:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:24:55,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:55,987 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:55,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:24:55,988 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:55,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1082855006, now seen corresponding path program 1 times [2025-01-09 04:24:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63657666] [2025-01-09 04:24:55,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:56,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:24:56,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:24:56,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:56,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:24:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:56,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63657666] [2025-01-09 04:24:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63657666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:56,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:56,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:24:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542410338] [2025-01-09 04:24:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:56,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:24:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:56,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:24:56,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:24:56,177 INFO L87 Difference]: Start difference. First operand 13369 states and 18840 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:56,792 INFO L93 Difference]: Finished difference Result 27333 states and 38782 transitions. [2025-01-09 04:24:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:24:56,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:24:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:56,845 INFO L225 Difference]: With dead ends: 27333 [2025-01-09 04:24:56,845 INFO L226 Difference]: Without dead ends: 24371 [2025-01-09 04:24:56,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:24:56,855 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 569 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:56,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 721 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24371 states. [2025-01-09 04:24:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24371 to 16329. [2025-01-09 04:24:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16329 states, 16328 states have (on average 1.4096031357177854) internal successors, (23016), 16328 states have internal predecessors, (23016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16329 states to 16329 states and 23016 transitions. [2025-01-09 04:24:57,382 INFO L78 Accepts]: Start accepts. Automaton has 16329 states and 23016 transitions. Word has length 76 [2025-01-09 04:24:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 16329 states and 23016 transitions. [2025-01-09 04:24:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 16329 states and 23016 transitions. [2025-01-09 04:24:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:24:57,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:57,385 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:57,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:24:57,385 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:57,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash 15272542, now seen corresponding path program 1 times [2025-01-09 04:24:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108676255] [2025-01-09 04:24:57,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:57,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:24:57,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:24:57,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:57,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:24:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108676255] [2025-01-09 04:24:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108676255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:57,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:24:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890257876] [2025-01-09 04:24:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:57,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:24:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:57,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:24:57,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:24:57,541 INFO L87 Difference]: Start difference. First operand 16329 states and 23016 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:58,092 INFO L93 Difference]: Finished difference Result 28597 states and 40590 transitions. [2025-01-09 04:24:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:24:58,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:24:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:58,149 INFO L225 Difference]: With dead ends: 28597 [2025-01-09 04:24:58,149 INFO L226 Difference]: Without dead ends: 26483 [2025-01-09 04:24:58,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:24:58,158 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 552 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:58,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 823 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2025-01-09 04:24:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 18441. [2025-01-09 04:24:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18441 states, 18440 states have (on average 1.4112798264642084) internal successors, (26024), 18440 states have internal predecessors, (26024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18441 states to 18441 states and 26024 transitions. [2025-01-09 04:24:58,726 INFO L78 Accepts]: Start accepts. Automaton has 18441 states and 26024 transitions. Word has length 76 [2025-01-09 04:24:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:58,726 INFO L471 AbstractCegarLoop]: Abstraction has 18441 states and 26024 transitions. [2025-01-09 04:24:58,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 18441 states and 26024 transitions. [2025-01-09 04:24:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:24:58,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:58,730 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:24:58,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:24:58,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:58,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1488834884, now seen corresponding path program 1 times [2025-01-09 04:24:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476028894] [2025-01-09 04:24:58,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:58,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:24:58,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:24:58,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:58,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:58,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476028894] [2025-01-09 04:24:58,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476028894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:58,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965065320] [2025-01-09 04:24:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:58,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:58,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:58,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:58,846 INFO L87 Difference]: Start difference. First operand 18441 states and 26024 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:59,296 INFO L93 Difference]: Finished difference Result 36845 states and 52010 transitions. [2025-01-09 04:24:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:59,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-01-09 04:24:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:59,340 INFO L225 Difference]: With dead ends: 36845 [2025-01-09 04:24:59,340 INFO L226 Difference]: Without dead ends: 18443 [2025-01-09 04:24:59,364 INFO L434 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 [2025-01-09 04:24:59,364 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 45 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:59,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2025-01-09 04:24:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 18441. [2025-01-09 04:24:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18441 states, 18440 states have (on average 1.3952277657266812) internal successors, (25728), 18440 states have internal predecessors, (25728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18441 states to 18441 states and 25728 transitions. [2025-01-09 04:25:00,167 INFO L78 Accepts]: Start accepts. Automaton has 18441 states and 25728 transitions. Word has length 77 [2025-01-09 04:25:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:00,168 INFO L471 AbstractCegarLoop]: Abstraction has 18441 states and 25728 transitions. [2025-01-09 04:25:00,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18441 states and 25728 transitions. [2025-01-09 04:25:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:25:00,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:00,170 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:00,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:25:00,170 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 605722006, now seen corresponding path program 1 times [2025-01-09 04:25:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139357471] [2025-01-09 04:25:00,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:00,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:25:00,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:25:00,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:00,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:00,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:00,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139357471] [2025-01-09 04:25:00,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139357471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:25:00,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:25:00,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:25:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625268318] [2025-01-09 04:25:00,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:25:00,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:25:00,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:00,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:25:00,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:25:00,267 INFO L87 Difference]: Start difference. First operand 18441 states and 25728 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:00,412 INFO L93 Difference]: Finished difference Result 25328 states and 35422 transitions. [2025-01-09 04:25:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:25:00,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-01-09 04:25:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:00,428 INFO L225 Difference]: With dead ends: 25328 [2025-01-09 04:25:00,428 INFO L226 Difference]: Without dead ends: 6926 [2025-01-09 04:25:00,445 INFO L434 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 [2025-01-09 04:25:00,446 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 39 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:00,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 227 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:25:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2025-01-09 04:25:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 6918. [2025-01-09 04:25:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6918 states, 6917 states have (on average 1.3909209194737604) internal successors, (9621), 6917 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 9621 transitions. [2025-01-09 04:25:00,594 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 9621 transitions. Word has length 78 [2025-01-09 04:25:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:00,594 INFO L471 AbstractCegarLoop]: Abstraction has 6918 states and 9621 transitions. [2025-01-09 04:25:00,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 9621 transitions. [2025-01-09 04:25:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:25:00,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:00,598 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:00,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:25:00,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:00,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1818701686, now seen corresponding path program 1 times [2025-01-09 04:25:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406658538] [2025-01-09 04:25:00,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:00,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:25:00,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:25:00,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:00,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:00,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:00,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406658538] [2025-01-09 04:25:00,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406658538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:25:00,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:25:00,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:25:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952344287] [2025-01-09 04:25:00,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:25:00,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:25:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:00,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:25:00,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:25:00,706 INFO L87 Difference]: Start difference. First operand 6918 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:00,776 INFO L93 Difference]: Finished difference Result 10354 states and 14407 transitions. [2025-01-09 04:25:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:25:00,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-09 04:25:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:00,785 INFO L225 Difference]: With dead ends: 10354 [2025-01-09 04:25:00,785 INFO L226 Difference]: Without dead ends: 3488 [2025-01-09 04:25:00,793 INFO L434 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 [2025-01-09 04:25:00,794 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:00,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:25:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-01-09 04:25:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3486. [2025-01-09 04:25:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3485 states have (on average 1.3730272596843616) internal successors, (4785), 3485 states have internal predecessors, (4785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4785 transitions. [2025-01-09 04:25:01,002 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4785 transitions. Word has length 79 [2025-01-09 04:25:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:01,002 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 4785 transitions. [2025-01-09 04:25:01,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4785 transitions. [2025-01-09 04:25:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:25:01,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:01,003 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:01,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:25:01,004 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1084701656, now seen corresponding path program 1 times [2025-01-09 04:25:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282138203] [2025-01-09 04:25:01,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:01,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:25:01,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:25:01,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:01,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:01,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:01,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282138203] [2025-01-09 04:25:01,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282138203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:25:01,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:25:01,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:25:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678935950] [2025-01-09 04:25:01,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:25:01,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:25:01,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:01,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:25:01,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:25:01,095 INFO L87 Difference]: Start difference. First operand 3486 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:01,135 INFO L93 Difference]: Finished difference Result 5206 states and 7153 transitions. [2025-01-09 04:25:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:25:01,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 04:25:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:01,140 INFO L225 Difference]: With dead ends: 5206 [2025-01-09 04:25:01,140 INFO L226 Difference]: Without dead ends: 1772 [2025-01-09 04:25:01,142 INFO L434 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 [2025-01-09 04:25:01,145 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 38 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:01,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:25:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-01-09 04:25:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1770. [2025-01-09 04:25:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 1.3527416619559074) internal successors, (2393), 1769 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2393 transitions. [2025-01-09 04:25:01,185 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2393 transitions. Word has length 81 [2025-01-09 04:25:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:01,186 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2393 transitions. [2025-01-09 04:25:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2393 transitions. [2025-01-09 04:25:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:25:01,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:01,187 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:01,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:25:01,188 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:01,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash -471748774, now seen corresponding path program 1 times [2025-01-09 04:25:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:01,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798786727] [2025-01-09 04:25:01,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:01,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:25:01,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:25:01,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:01,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:01,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798786727] [2025-01-09 04:25:01,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798786727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:25:01,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:25:01,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:25:01,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856978900] [2025-01-09 04:25:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:25:01,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:25:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:01,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:25:01,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:25:01,279 INFO L87 Difference]: Start difference. First operand 1770 states and 2393 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:01,303 INFO L93 Difference]: Finished difference Result 2632 states and 3565 transitions. [2025-01-09 04:25:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:25:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-09 04:25:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:01,306 INFO L225 Difference]: With dead ends: 2632 [2025-01-09 04:25:01,306 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 04:25:01,307 INFO L434 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 [2025-01-09 04:25:01,308 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:01,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:25:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 04:25:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2025-01-09 04:25:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 911 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1210 transitions. [2025-01-09 04:25:01,329 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1210 transitions. Word has length 83 [2025-01-09 04:25:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:01,329 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1210 transitions. [2025-01-09 04:25:01,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1210 transitions. [2025-01-09 04:25:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:25:01,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:01,331 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:01,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:25:01,332 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1766256372, now seen corresponding path program 1 times [2025-01-09 04:25:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239256435] [2025-01-09 04:25:01,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:01,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:25:01,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:25:01,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:01,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:02,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:02,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239256435] [2025-01-09 04:25:02,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239256435] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:25:02,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242970442] [2025-01-09 04:25:02,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:02,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:25:02,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:25:02,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:25:02,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:25:02,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:25:02,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:02,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:02,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:25:02,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:02,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:03,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242970442] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:03,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:03,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-01-09 04:25:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56847575] [2025-01-09 04:25:03,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:03,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:25:03,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:03,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:25:03,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:25:03,489 INFO L87 Difference]: Start difference. First operand 912 states and 1210 transitions. Second operand has 22 states, 22 states have (on average 11.045454545454545) internal successors, (243), 22 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:07,577 INFO L93 Difference]: Finished difference Result 8002 states and 10666 transitions. [2025-01-09 04:25:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-09 04:25:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.045454545454545) internal successors, (243), 22 states have internal predecessors, (243), 0 states have call successors, (0), 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 85 [2025-01-09 04:25:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:07,591 INFO L225 Difference]: With dead ends: 8002 [2025-01-09 04:25:07,592 INFO L226 Difference]: Without dead ends: 7064 [2025-01-09 04:25:07,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1351, Invalid=7021, Unknown=0, NotChecked=0, Total=8372 [2025-01-09 04:25:07,598 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3698 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3698 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:07,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3698 Valid, 789 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:25:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7064 states. [2025-01-09 04:25:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7064 to 6492. [2025-01-09 04:25:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6492 states, 6491 states have (on average 1.312740717917116) internal successors, (8521), 6491 states have internal predecessors, (8521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 8521 transitions. [2025-01-09 04:25:07,791 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 8521 transitions. Word has length 85 [2025-01-09 04:25:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 6492 states and 8521 transitions. [2025-01-09 04:25:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.045454545454545) internal successors, (243), 22 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 8521 transitions. [2025-01-09 04:25:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:25:07,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:07,793 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:07,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:25:07,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 04:25:07,994 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:07,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1883369010, now seen corresponding path program 1 times [2025-01-09 04:25:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142665489] [2025-01-09 04:25:07,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:25:08,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:25:08,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:08,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142665489] [2025-01-09 04:25:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142665489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:25:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743572430] [2025-01-09 04:25:08,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:08,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:08,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:25:08,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:25:08,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:25:09,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:25:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:25:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:09,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:25:09,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:09,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743572430] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:10,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:10,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 04:25:10,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414668637] [2025-01-09 04:25:10,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:25:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:10,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:25:10,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:25:10,258 INFO L87 Difference]: Start difference. First operand 6492 states and 8521 transitions. Second operand has 28 states, 28 states have (on average 7.964285714285714) internal successors, (223), 27 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:11,950 INFO L93 Difference]: Finished difference Result 33856 states and 44332 transitions. [2025-01-09 04:25:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 04:25:11,950 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.964285714285714) internal successors, (223), 27 states have internal predecessors, (223), 0 states have call successors, (0), 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 86 [2025-01-09 04:25:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:11,996 INFO L225 Difference]: With dead ends: 33856 [2025-01-09 04:25:11,997 INFO L226 Difference]: Without dead ends: 27661 [2025-01-09 04:25:12,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=748, Invalid=3034, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 04:25:12,011 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 1688 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:12,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 749 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:25:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27661 states. [2025-01-09 04:25:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27661 to 25041. [2025-01-09 04:25:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25041 states, 25040 states have (on average 1.2855830670926518) internal successors, (32191), 25040 states have internal predecessors, (32191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25041 states to 25041 states and 32191 transitions. [2025-01-09 04:25:12,902 INFO L78 Accepts]: Start accepts. Automaton has 25041 states and 32191 transitions. Word has length 86 [2025-01-09 04:25:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 25041 states and 32191 transitions. [2025-01-09 04:25:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.964285714285714) internal successors, (223), 27 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 25041 states and 32191 transitions. [2025-01-09 04:25:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:25:12,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:12,905 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:12,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:25:13,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:13,106 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash 934007104, now seen corresponding path program 1 times [2025-01-09 04:25:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188201167] [2025-01-09 04:25:13,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:13,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:13,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:25:13,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:25:13,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:13,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:13,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188201167] [2025-01-09 04:25:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188201167] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:25:13,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451848752] [2025-01-09 04:25:13,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:13,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:13,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:25:13,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:25:13,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:25:13,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:25:13,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:25:13,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:13,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:13,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:25:13,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:14,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451848752] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:15,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:15,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 04:25:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578714023] [2025-01-09 04:25:15,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:15,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:25:15,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:15,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:25:15,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:25:15,285 INFO L87 Difference]: Start difference. First operand 25041 states and 32191 transitions. Second operand has 25 states, 25 states have (on average 9.72) internal successors, (243), 24 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:16,956 INFO L93 Difference]: Finished difference Result 49870 states and 64256 transitions. [2025-01-09 04:25:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 04:25:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.72) internal successors, (243), 24 states have internal predecessors, (243), 0 states have call successors, (0), 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 86 [2025-01-09 04:25:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:16,997 INFO L225 Difference]: With dead ends: 49870 [2025-01-09 04:25:16,997 INFO L226 Difference]: Without dead ends: 26385 [2025-01-09 04:25:17,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 04:25:17,013 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1419 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:17,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 1041 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:25:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26385 states. [2025-01-09 04:25:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26385 to 22381. [2025-01-09 04:25:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22381 states, 22380 states have (on average 1.261438784629133) internal successors, (28231), 22380 states have internal predecessors, (28231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22381 states to 22381 states and 28231 transitions. [2025-01-09 04:25:17,513 INFO L78 Accepts]: Start accepts. Automaton has 22381 states and 28231 transitions. Word has length 86 [2025-01-09 04:25:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:17,514 INFO L471 AbstractCegarLoop]: Abstraction has 22381 states and 28231 transitions. [2025-01-09 04:25:17,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.72) internal successors, (243), 24 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22381 states and 28231 transitions. [2025-01-09 04:25:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:25:17,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:17,516 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:17,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:25:17,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:17,721 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1946880866, now seen corresponding path program 1 times [2025-01-09 04:25:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:17,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222165314] [2025-01-09 04:25:17,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:17,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:17,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:25:17,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:25:17,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:17,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:18,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:18,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222165314] [2025-01-09 04:25:18,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222165314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:25:18,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366053088] [2025-01-09 04:25:18,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:25:18,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:25:18,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:25:18,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:25:18,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:25:18,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:18,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:18,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:25:18,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:18,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:19,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366053088] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:19,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:19,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 04:25:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747644193] [2025-01-09 04:25:19,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:19,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:25:19,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:19,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:25:19,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:25:19,618 INFO L87 Difference]: Start difference. First operand 22381 states and 28231 transitions. Second operand has 28 states, 28 states have (on average 7.607142857142857) internal successors, (213), 27 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:21,496 INFO L93 Difference]: Finished difference Result 74967 states and 95050 transitions. [2025-01-09 04:25:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 04:25:21,497 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.607142857142857) internal successors, (213), 27 states have internal predecessors, (213), 0 states have call successors, (0), 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 87 [2025-01-09 04:25:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:21,572 INFO L225 Difference]: With dead ends: 74967 [2025-01-09 04:25:21,573 INFO L226 Difference]: Without dead ends: 54577 [2025-01-09 04:25:21,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=612, Invalid=2358, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 04:25:21,601 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1501 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:21,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1086 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:25:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54577 states. [2025-01-09 04:25:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54577 to 54173. [2025-01-09 04:25:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54173 states, 54172 states have (on average 1.258251495237392) internal successors, (68162), 54172 states have internal predecessors, (68162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54173 states to 54173 states and 68162 transitions. [2025-01-09 04:25:23,081 INFO L78 Accepts]: Start accepts. Automaton has 54173 states and 68162 transitions. Word has length 87 [2025-01-09 04:25:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:23,082 INFO L471 AbstractCegarLoop]: Abstraction has 54173 states and 68162 transitions. [2025-01-09 04:25:23,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.607142857142857) internal successors, (213), 27 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 54173 states and 68162 transitions. [2025-01-09 04:25:23,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:25:23,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:23,084 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:23,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:25:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 04:25:23,285 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1577847952, now seen corresponding path program 1 times [2025-01-09 04:25:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678914377] [2025-01-09 04:25:23,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:23,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:25:23,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:25:23,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:23,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:23,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678914377] [2025-01-09 04:25:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678914377] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:25:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187215219] [2025-01-09 04:25:23,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:23,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:23,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:25:23,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:25:23,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:25:23,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:25:23,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:25:23,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:23,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:23,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:25:23,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:24,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187215219] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:24,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 04:25:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549594582] [2025-01-09 04:25:24,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:24,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:25:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:24,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:25:24,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:25:24,562 INFO L87 Difference]: Start difference. First operand 54173 states and 68162 transitions. Second operand has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:25:25,855 INFO L93 Difference]: Finished difference Result 104663 states and 132103 transitions. [2025-01-09 04:25:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:25:25,856 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 0 states have call successors, (0), 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 88 [2025-01-09 04:25:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:25:25,922 INFO L225 Difference]: With dead ends: 104663 [2025-01-09 04:25:25,922 INFO L226 Difference]: Without dead ends: 55969 [2025-01-09 04:25:25,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:25:25,961 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 743 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:25:25,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 573 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:25:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55969 states. [2025-01-09 04:25:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55969 to 53385. [2025-01-09 04:25:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53385 states, 53384 states have (on average 1.2483141016034767) internal successors, (66640), 53384 states have internal predecessors, (66640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53385 states to 53385 states and 66640 transitions. [2025-01-09 04:25:27,774 INFO L78 Accepts]: Start accepts. Automaton has 53385 states and 66640 transitions. Word has length 88 [2025-01-09 04:25:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:25:27,774 INFO L471 AbstractCegarLoop]: Abstraction has 53385 states and 66640 transitions. [2025-01-09 04:25:27,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 20 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:25:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 53385 states and 66640 transitions. [2025-01-09 04:25:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:25:27,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:25:27,777 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:25:27,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:25:27,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 04:25:27,978 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:25:27,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:25:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash 647091422, now seen corresponding path program 1 times [2025-01-09 04:25:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:25:27,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976233630] [2025-01-09 04:25:27,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:25:27,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:25:28,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:25:28,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:28,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:30,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:25:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976233630] [2025-01-09 04:25:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976233630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:25:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955550699] [2025-01-09 04:25:30,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:25:30,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:25:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:25:30,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:25:30,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:25:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 04:25:30,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:25:30,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:25:30,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:25:30,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 04:25:30,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:25:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:33,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:25:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:25:37,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955550699] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:25:37,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:25:37,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 27] total 81 [2025-01-09 04:25:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825311149] [2025-01-09 04:25:37,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:25:37,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-01-09 04:25:37,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:25:37,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-01-09 04:25:37,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=5926, Unknown=0, NotChecked=0, Total=6480 [2025-01-09 04:25:37,627 INFO L87 Difference]: Start difference. First operand 53385 states and 66640 transitions. Second operand has 81 states, 81 states have (on average 3.123456790123457) internal successors, (253), 81 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)