./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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 d88f56b65c964ba52afb6589890f47808246433fd1cd2f6e6c97070f65703887 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:56:17,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:56:17,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:56:17,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:56:17,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:56:17,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:56:17,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:56:17,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:56:17,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:56:17,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:56:17,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:56:17,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:56:17,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:56:17,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:56:17,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:56:17,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:56:17,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:56:17,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:56:17,424 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 -> d88f56b65c964ba52afb6589890f47808246433fd1cd2f6e6c97070f65703887 [2025-01-09 05:56:17,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:56:17,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:56:17,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:56:17,704 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:56:17,705 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:56:17,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-01-09 05:56:18,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbadcd70a/0538c1e0bf5a441290e8949efd2b7b7a/FLAGaa0e4ee08 [2025-01-09 05:56:19,491 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:56:19,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-01-09 05:56:19,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbadcd70a/0538c1e0bf5a441290e8949efd2b7b7a/FLAGaa0e4ee08 [2025-01-09 05:56:19,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbadcd70a/0538c1e0bf5a441290e8949efd2b7b7a [2025-01-09 05:56:19,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:56:19,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:56:19,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:56:19,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:56:19,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:56:19,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:56:19" (1/1) ... [2025-01-09 05:56:19,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:19, skipping insertion in model container [2025-01-09 05:56:19,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:56:19" (1/1) ... [2025-01-09 05:56:19,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:56:19,958 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[15584,15597] [2025-01-09 05:56:20,023 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[22645,22658] [2025-01-09 05:56:20,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:56:20,477 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:56:20,511 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[15584,15597] [2025-01-09 05:56:20,520 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[22645,22658] [2025-01-09 05:56:20,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:56:20,821 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:56:20,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20 WrapperNode [2025-01-09 05:56:20,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:56:20,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:56:20,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:56:20,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:56:20,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:20,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,147 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5149 [2025-01-09 05:56:21,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:56:21,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:56:21,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:56:21,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:56:21,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,359 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 05:56:21,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:56:21,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:56:21,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:56:21,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:56:21,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (1/1) ... [2025-01-09 05:56:21,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:56:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:21,637 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 05:56:21,640 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 05:56:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:56:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:56:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:56:21,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:56:21,754 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:56:21,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:56:25,209 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:56:25,209 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:56:25,229 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:56:25,229 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:56:25,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:56:25 BoogieIcfgContainer [2025-01-09 05:56:25,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:56:25,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:56:25,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:56:25,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:56:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:56:19" (1/3) ... [2025-01-09 05:56:25,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3702c381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:56:25, skipping insertion in model container [2025-01-09 05:56:25,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:56:20" (2/3) ... [2025-01-09 05:56:25,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3702c381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:56:25, skipping insertion in model container [2025-01-09 05:56:25,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:56:25" (3/3) ... [2025-01-09 05:56:25,237 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-01-09 05:56:25,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:56:25,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:56:25,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:56:25,313 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;@4a589b5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:56:25,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:56:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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 05:56:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:56:25,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:25,324 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] [2025-01-09 05:56:25,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 778313314, now seen corresponding path program 1 times [2025-01-09 05:56:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538547176] [2025-01-09 05:56:25,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:25,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:25,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:56:25,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:56:25,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:25,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:25,480 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 05:56:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:25,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538547176] [2025-01-09 05:56:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538547176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:25,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:56:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833222525] [2025-01-09 05:56:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:25,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:56:25,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:25,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:56:25,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:56:25,501 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 05:56:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:25,558 INFO L93 Difference]: Finished difference Result 1779 states and 3375 transitions. [2025-01-09 05:56:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:56:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-09 05:56:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:25,574 INFO L225 Difference]: With dead ends: 1779 [2025-01-09 05:56:25,574 INFO L226 Difference]: Without dead ends: 848 [2025-01-09 05:56:25,578 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 05:56:25,580 INFO L435 NwaCegarLoop]: 1666 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, 1666 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 05:56:25,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-01-09 05:56:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-01-09 05:56:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.8936170212765957) internal successors, (1602), 847 states have internal predecessors, (1602), 0 states have call successors, (0), 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 05:56:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1602 transitions. [2025-01-09 05:56:25,638 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1602 transitions. Word has length 26 [2025-01-09 05:56:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:25,638 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1602 transitions. [2025-01-09 05:56:25,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 05:56:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1602 transitions. [2025-01-09 05:56:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:56:25,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:25,639 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] [2025-01-09 05:56:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:56:25,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -39335136, now seen corresponding path program 1 times [2025-01-09 05:56:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:25,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219039352] [2025-01-09 05:56:25,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:25,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:56:25,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:56:25,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:25,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:25,882 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 05:56:25,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:25,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219039352] [2025-01-09 05:56:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219039352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:56:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553578427] [2025-01-09 05:56:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:25,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:56:25,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:25,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:56:25,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:56:25,884 INFO L87 Difference]: Start difference. First operand 848 states and 1602 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 05:56:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:26,019 INFO L93 Difference]: Finished difference Result 900 states and 1683 transitions. [2025-01-09 05:56:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:56:26,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-09 05:56:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:26,024 INFO L225 Difference]: With dead ends: 900 [2025-01-09 05:56:26,024 INFO L226 Difference]: Without dead ends: 848 [2025-01-09 05:56:26,025 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 05:56:26,025 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:26,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-01-09 05:56:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-01-09 05:56:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.846335697399527) internal successors, (1562), 847 states have internal predecessors, (1562), 0 states have call successors, (0), 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 05:56:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1562 transitions. [2025-01-09 05:56:26,069 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1562 transitions. Word has length 26 [2025-01-09 05:56:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:26,070 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1562 transitions. [2025-01-09 05:56:26,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 05:56:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1562 transitions. [2025-01-09 05:56:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 05:56:26,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:26,071 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, 1, 1, 1, 1] [2025-01-09 05:56:26,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:56:26,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:26,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1003207595, now seen corresponding path program 1 times [2025-01-09 05:56:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489027506] [2025-01-09 05:56:26,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:56:26,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:56:26,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:26,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:26,210 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 05:56:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489027506] [2025-01-09 05:56:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489027506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:56:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707014540] [2025-01-09 05:56:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:26,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:26,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:26,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:26,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:26,214 INFO L87 Difference]: Start difference. First operand 848 states and 1562 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:29,629 INFO L93 Difference]: Finished difference Result 2352 states and 4435 transitions. [2025-01-09 05:56:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:29,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 05:56:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:29,635 INFO L225 Difference]: With dead ends: 2352 [2025-01-09 05:56:29,635 INFO L226 Difference]: Without dead ends: 1599 [2025-01-09 05:56:29,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:29,637 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 877 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:29,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 200 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 05:56:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-01-09 05:56:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-01-09 05:56:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.839073262366938) internal successors, (2937), 1598 states have internal predecessors, (2937), 0 states have call successors, (0), 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 05:56:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2937 transitions. [2025-01-09 05:56:29,671 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2937 transitions. Word has length 61 [2025-01-09 05:56:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:29,671 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2937 transitions. [2025-01-09 05:56:29,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2937 transitions. [2025-01-09 05:56:29,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:56:29,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:29,673 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:56:29,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1783115668, now seen corresponding path program 1 times [2025-01-09 05:56:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843539518] [2025-01-09 05:56:29,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:29,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:56:29,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:56:29,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:29,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:29,835 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 05:56:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843539518] [2025-01-09 05:56:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843539518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:29,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947778133] [2025-01-09 05:56:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:29,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:29,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:29,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:29,837 INFO L87 Difference]: Start difference. First operand 1599 states and 2937 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 05:56:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:30,121 INFO L93 Difference]: Finished difference Result 2175 states and 3861 transitions. [2025-01-09 05:56:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:56:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-01-09 05:56:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:30,129 INFO L225 Difference]: With dead ends: 2175 [2025-01-09 05:56:30,130 INFO L226 Difference]: Without dead ends: 2127 [2025-01-09 05:56:30,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:56:30,133 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9697 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9697 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:30,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9697 Valid, 3935 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-01-09 05:56:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1645. [2025-01-09 05:56:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.8326232501521607) internal successors, (3011), 1644 states have internal predecessors, (3011), 0 states have call successors, (0), 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 05:56:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 3011 transitions. [2025-01-09 05:56:30,167 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 3011 transitions. Word has length 65 [2025-01-09 05:56:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:30,169 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 3011 transitions. [2025-01-09 05:56:30,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 05:56:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 3011 transitions. [2025-01-09 05:56:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:56:30,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:30,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:30,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:56:30,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:30,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1297900228, now seen corresponding path program 1 times [2025-01-09 05:56:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272173134] [2025-01-09 05:56:30,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:30,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:56:30,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:56:30,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:30,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:30,302 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 05:56:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:30,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272173134] [2025-01-09 05:56:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272173134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:30,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:30,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:30,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791656628] [2025-01-09 05:56:30,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:30,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:30,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:30,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:30,304 INFO L87 Difference]: Start difference. First operand 1645 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 05:56:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:30,332 INFO L93 Difference]: Finished difference Result 1822 states and 3294 transitions. [2025-01-09 05:56:30,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 67 [2025-01-09 05:56:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:30,338 INFO L225 Difference]: With dead ends: 1822 [2025-01-09 05:56:30,338 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:56:30,338 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 05:56:30,340 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 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 05:56:30,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:56:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:56:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.8207656612529002) internal successors, (3139), 1725 states have internal predecessors, (3139), 0 states have call successors, (0), 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 05:56:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3139 transitions. [2025-01-09 05:56:30,372 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3139 transitions. Word has length 67 [2025-01-09 05:56:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:30,373 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 3139 transitions. [2025-01-09 05:56:30,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 05:56:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3139 transitions. [2025-01-09 05:56:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:56:30,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:30,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:30,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:56:30,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:30,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1231406716, now seen corresponding path program 1 times [2025-01-09 05:56:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:30,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975997651] [2025-01-09 05:56:30,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:30,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:56:30,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:56:30,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:30,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:30,678 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 05:56:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975997651] [2025-01-09 05:56:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975997651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459440621] [2025-01-09 05:56:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:30,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:30,680 INFO L87 Difference]: Start difference. First operand 1726 states and 3139 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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 05:56:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:30,861 INFO L93 Difference]: Finished difference Result 1903 states and 3419 transitions. [2025-01-09 05:56:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:30,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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 67 [2025-01-09 05:56:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:30,867 INFO L225 Difference]: With dead ends: 1903 [2025-01-09 05:56:30,867 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:56:30,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:56:30,868 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 8992 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8992 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:30,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8992 Valid, 1922 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:56:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:56:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.8196055684454757) internal successors, (3137), 1725 states have internal predecessors, (3137), 0 states have call successors, (0), 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 05:56:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3137 transitions. [2025-01-09 05:56:30,928 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3137 transitions. Word has length 67 [2025-01-09 05:56:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:30,928 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 3137 transitions. [2025-01-09 05:56:30,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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 05:56:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3137 transitions. [2025-01-09 05:56:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:56:30,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:30,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:30,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:56:30,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 66374464, now seen corresponding path program 1 times [2025-01-09 05:56:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222383639] [2025-01-09 05:56:30,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:30,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:56:30,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:56:30,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:30,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:31,115 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 05:56:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222383639] [2025-01-09 05:56:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222383639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:56:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835438859] [2025-01-09 05:56:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:56:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:31,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:56:31,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:56:31,118 INFO L87 Difference]: Start difference. First operand 1726 states and 3137 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 05:56:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:31,151 INFO L93 Difference]: Finished difference Result 1734 states and 3146 transitions. [2025-01-09 05:56:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:56:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 05:56:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:31,158 INFO L225 Difference]: With dead ends: 1734 [2025-01-09 05:56:31,158 INFO L226 Difference]: Without dead ends: 1732 [2025-01-09 05:56:31,159 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 05:56:31,159 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6227 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:31,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6227 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-01-09 05:56:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2025-01-09 05:56:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.8161849710982658) internal successors, (3142), 1731 states have internal predecessors, (3142), 0 states have call successors, (0), 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 05:56:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3142 transitions. [2025-01-09 05:56:31,188 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3142 transitions. Word has length 68 [2025-01-09 05:56:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:31,189 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 3142 transitions. [2025-01-09 05:56:31,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 05:56:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3142 transitions. [2025-01-09 05:56:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:56:31,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:31,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:31,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:56:31,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2026826780, now seen corresponding path program 1 times [2025-01-09 05:56:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132400598] [2025-01-09 05:56:31,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:31,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:56:31,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:56:31,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:31,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:31,252 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 05:56:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132400598] [2025-01-09 05:56:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132400598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:31,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028492969] [2025-01-09 05:56:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:31,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:31,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:31,255 INFO L87 Difference]: Start difference. First operand 1732 states and 3142 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:31,275 INFO L93 Difference]: Finished difference Result 1926 states and 3443 transitions. [2025-01-09 05:56:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:31,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 05:56:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:31,280 INFO L225 Difference]: With dead ends: 1926 [2025-01-09 05:56:31,280 INFO L226 Difference]: Without dead ends: 1826 [2025-01-09 05:56:31,281 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 05:56:31,281 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1702 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 05:56:31,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:31,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-01-09 05:56:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2025-01-09 05:56:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 1.8018660812294183) internal successors, (3283), 1823 states have internal predecessors, (3283), 0 states have call successors, (0), 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 05:56:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 3283 transitions. [2025-01-09 05:56:31,311 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 3283 transitions. Word has length 69 [2025-01-09 05:56:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:31,312 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 3283 transitions. [2025-01-09 05:56:31,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 3283 transitions. [2025-01-09 05:56:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:56:31,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:31,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:31,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:56:31,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:31,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1863912220, now seen corresponding path program 1 times [2025-01-09 05:56:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190990745] [2025-01-09 05:56:31,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:31,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:56:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:56:31,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:31,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:31,373 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 05:56:31,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:31,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190990745] [2025-01-09 05:56:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190990745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453209192] [2025-01-09 05:56:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:31,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:31,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:31,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:31,375 INFO L87 Difference]: Start difference. First operand 1824 states and 3283 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:31,399 INFO L93 Difference]: Finished difference Result 2342 states and 4083 transitions. [2025-01-09 05:56:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:31,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 05:56:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:31,405 INFO L225 Difference]: With dead ends: 2342 [2025-01-09 05:56:31,405 INFO L226 Difference]: Without dead ends: 2071 [2025-01-09 05:56:31,406 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 05:56:31,407 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1708 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 05:56:31,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-01-09 05:56:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2069. [2025-01-09 05:56:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2067 states have (on average 1.768263183357523) internal successors, (3655), 2068 states have internal predecessors, (3655), 0 states have call successors, (0), 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 05:56:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3655 transitions. [2025-01-09 05:56:31,442 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3655 transitions. Word has length 69 [2025-01-09 05:56:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:31,443 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3655 transitions. [2025-01-09 05:56:31,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3655 transitions. [2025-01-09 05:56:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:56:31,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:31,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:31,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:56:31,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:31,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1600055836, now seen corresponding path program 1 times [2025-01-09 05:56:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164700990] [2025-01-09 05:56:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:31,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:56:31,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:56:31,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:31,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:31,487 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 05:56:31,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:31,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164700990] [2025-01-09 05:56:31,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164700990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:31,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32671680] [2025-01-09 05:56:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:31,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:31,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:31,488 INFO L87 Difference]: Start difference. First operand 2069 states and 3655 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:31,516 INFO L93 Difference]: Finished difference Result 3053 states and 5157 transitions. [2025-01-09 05:56:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:31,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 05:56:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:31,523 INFO L225 Difference]: With dead ends: 3053 [2025-01-09 05:56:31,523 INFO L226 Difference]: Without dead ends: 2537 [2025-01-09 05:56:31,525 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 05:56:31,525 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 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 05:56:31,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-01-09 05:56:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-01-09 05:56:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2533 states have (on average 1.717726016581129) internal successors, (4351), 2534 states have internal predecessors, (4351), 0 states have call successors, (0), 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 05:56:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 4351 transitions. [2025-01-09 05:56:31,568 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 4351 transitions. Word has length 69 [2025-01-09 05:56:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:31,568 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 4351 transitions. [2025-01-09 05:56:31,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 4351 transitions. [2025-01-09 05:56:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:56:31,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:31,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:31,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:56:31,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -361793820, now seen corresponding path program 1 times [2025-01-09 05:56:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:31,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622876706] [2025-01-09 05:56:31,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:31,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:56:31,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:56:31,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:31,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:31,610 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 05:56:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622876706] [2025-01-09 05:56:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622876706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384390664] [2025-01-09 05:56:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:31,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:31,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:31,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:31,611 INFO L87 Difference]: Start difference. First operand 2535 states and 4351 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:31,647 INFO L93 Difference]: Finished difference Result 4403 states and 7161 transitions. [2025-01-09 05:56:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:31,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 05:56:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:31,657 INFO L225 Difference]: With dead ends: 4403 [2025-01-09 05:56:31,657 INFO L226 Difference]: Without dead ends: 3421 [2025-01-09 05:56:31,659 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 05:56:31,659 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 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 05:56:31,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-01-09 05:56:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3419. [2025-01-09 05:56:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.652619256657887) internal successors, (5647), 3418 states have internal predecessors, (5647), 0 states have call successors, (0), 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 05:56:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5647 transitions. [2025-01-09 05:56:31,722 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5647 transitions. Word has length 69 [2025-01-09 05:56:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5647 transitions. [2025-01-09 05:56:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5647 transitions. [2025-01-09 05:56:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:56:31,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:31,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:56:31,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:31,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -796329756, now seen corresponding path program 1 times [2025-01-09 05:56:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009897065] [2025-01-09 05:56:31,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:31,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:56:31,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:56:31,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:31,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:31,772 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 05:56:31,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:31,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009897065] [2025-01-09 05:56:31,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009897065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:31,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:31,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776963680] [2025-01-09 05:56:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:31,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:31,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:31,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:31,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:31,774 INFO L87 Difference]: Start difference. First operand 3419 states and 5647 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:31,820 INFO L93 Difference]: Finished difference Result 6959 states and 10881 transitions. [2025-01-09 05:56:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:31,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 05:56:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:31,833 INFO L225 Difference]: With dead ends: 6959 [2025-01-09 05:56:31,834 INFO L226 Difference]: Without dead ends: 5093 [2025-01-09 05:56:31,837 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 05:56:31,837 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1708 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 05:56:31,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2025-01-09 05:56:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 5091. [2025-01-09 05:56:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 5089 states have (on average 1.5812536844173708) internal successors, (8047), 5090 states have internal predecessors, (8047), 0 states have call successors, (0), 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 05:56:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 8047 transitions. [2025-01-09 05:56:31,926 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 8047 transitions. Word has length 69 [2025-01-09 05:56:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:31,927 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 8047 transitions. [2025-01-09 05:56:31,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 8047 transitions. [2025-01-09 05:56:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:56:31,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:31,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:31,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:56:31,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:31,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1717704676, now seen corresponding path program 1 times [2025-01-09 05:56:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997221491] [2025-01-09 05:56:31,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:31,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:56:31,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:56:31,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:31,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:31,968 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 05:56:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:31,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997221491] [2025-01-09 05:56:31,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997221491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:31,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:31,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234383465] [2025-01-09 05:56:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:31,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:31,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:31,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:31,970 INFO L87 Difference]: Start difference. First operand 5091 states and 8047 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:32,076 INFO L93 Difference]: Finished difference Result 11783 states and 17745 transitions. [2025-01-09 05:56:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:32,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-01-09 05:56:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:32,093 INFO L225 Difference]: With dead ends: 11783 [2025-01-09 05:56:32,094 INFO L226 Difference]: Without dead ends: 8245 [2025-01-09 05:56:32,098 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 05:56:32,099 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 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 05:56:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2025-01-09 05:56:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 8243. [2025-01-09 05:56:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8243 states, 8241 states have (on average 1.5123164664482465) internal successors, (12463), 8242 states have internal predecessors, (12463), 0 states have call successors, (0), 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 05:56:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 12463 transitions. [2025-01-09 05:56:32,253 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 12463 transitions. Word has length 69 [2025-01-09 05:56:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:32,254 INFO L471 AbstractCegarLoop]: Abstraction has 8243 states and 12463 transitions. [2025-01-09 05:56:32,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 05:56:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 12463 transitions. [2025-01-09 05:56:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:56:32,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:32,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:32,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:56:32,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:32,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1175898238, now seen corresponding path program 1 times [2025-01-09 05:56:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212784601] [2025-01-09 05:56:32,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:32,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:32,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:56:32,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:56:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:56:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212784601] [2025-01-09 05:56:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212784601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:32,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:32,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471286545] [2025-01-09 05:56:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:32,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:32,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:32,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:32,405 INFO L87 Difference]: Start difference. First operand 8243 states and 12463 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 05:56:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:32,925 INFO L93 Difference]: Finished difference Result 47841 states and 69238 transitions. [2025-01-09 05:56:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:32,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 90 [2025-01-09 05:56:32,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:33,000 INFO L225 Difference]: With dead ends: 47841 [2025-01-09 05:56:33,000 INFO L226 Difference]: Without dead ends: 43103 [2025-01-09 05:56:33,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:56:33,014 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8085 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8085 SdHoareTripleChecker+Valid, 4101 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:33,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8085 Valid, 4101 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43103 states. [2025-01-09 05:56:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43103 to 13971. [2025-01-09 05:56:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13971 states, 13969 states have (on average 1.4740496814374686) internal successors, (20591), 13970 states have internal predecessors, (20591), 0 states have call successors, (0), 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 05:56:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13971 states to 13971 states and 20591 transitions. [2025-01-09 05:56:33,477 INFO L78 Accepts]: Start accepts. Automaton has 13971 states and 20591 transitions. Word has length 90 [2025-01-09 05:56:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:33,478 INFO L471 AbstractCegarLoop]: Abstraction has 13971 states and 20591 transitions. [2025-01-09 05:56:33,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 05:56:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 13971 states and 20591 transitions. [2025-01-09 05:56:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:56:33,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:33,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:33,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:56:33,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:33,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1012983678, now seen corresponding path program 1 times [2025-01-09 05:56:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:33,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139608824] [2025-01-09 05:56:33,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:33,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:56:33,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:56:33,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:33,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:56:33,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:33,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139608824] [2025-01-09 05:56:33,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139608824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:33,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:33,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396496695] [2025-01-09 05:56:33,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:33,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:33,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:33,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:33,775 INFO L87 Difference]: Start difference. First operand 13971 states and 20591 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 05:56:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:34,530 INFO L93 Difference]: Finished difference Result 54529 states and 78774 transitions. [2025-01-09 05:56:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 90 [2025-01-09 05:56:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:34,593 INFO L225 Difference]: With dead ends: 54529 [2025-01-09 05:56:34,593 INFO L226 Difference]: Without dead ends: 47839 [2025-01-09 05:56:34,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:56:34,615 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8085 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8085 SdHoareTripleChecker+Valid, 4087 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:34,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8085 Valid, 4087 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47839 states. [2025-01-09 05:56:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47839 to 23027. [2025-01-09 05:56:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23027 states, 23025 states have (on average 1.4515960912052117) internal successors, (33423), 23026 states have internal predecessors, (33423), 0 states have call successors, (0), 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 05:56:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23027 states to 23027 states and 33423 transitions. [2025-01-09 05:56:35,224 INFO L78 Accepts]: Start accepts. Automaton has 23027 states and 33423 transitions. Word has length 90 [2025-01-09 05:56:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:35,224 INFO L471 AbstractCegarLoop]: Abstraction has 23027 states and 33423 transitions. [2025-01-09 05:56:35,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 05:56:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23027 states and 33423 transitions. [2025-01-09 05:56:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:56:35,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:35,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:35,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:56:35,230 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:35,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash -749127294, now seen corresponding path program 1 times [2025-01-09 05:56:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205237465] [2025-01-09 05:56:35,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:35,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:56:35,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:56:35,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:35,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:56:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:35,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205237465] [2025-01-09 05:56:35,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205237465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:35,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:35,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470078009] [2025-01-09 05:56:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:35,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:35,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:35,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:35,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:35,379 INFO L87 Difference]: Start difference. First operand 23027 states and 33423 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 05:56:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:36,116 INFO L93 Difference]: Finished difference Result 61217 states and 88278 transitions. [2025-01-09 05:56:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:36,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 90 [2025-01-09 05:56:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:36,202 INFO L225 Difference]: With dead ends: 61217 [2025-01-09 05:56:36,202 INFO L226 Difference]: Without dead ends: 54527 [2025-01-09 05:56:36,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:56:36,223 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8109 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8109 SdHoareTripleChecker+Valid, 4015 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:36,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8109 Valid, 4015 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54527 states. [2025-01-09 05:56:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54527 to 29715. [2025-01-09 05:56:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29715 states, 29713 states have (on average 1.4447211658196748) internal successors, (42927), 29714 states have internal predecessors, (42927), 0 states have call successors, (0), 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 05:56:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29715 states to 29715 states and 42927 transitions. [2025-01-09 05:56:37,037 INFO L78 Accepts]: Start accepts. Automaton has 29715 states and 42927 transitions. Word has length 90 [2025-01-09 05:56:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:37,038 INFO L471 AbstractCegarLoop]: Abstraction has 29715 states and 42927 transitions. [2025-01-09 05:56:37,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 05:56:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 29715 states and 42927 transitions. [2025-01-09 05:56:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:56:37,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:37,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:56:37,042 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 489134722, now seen corresponding path program 1 times [2025-01-09 05:56:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994537353] [2025-01-09 05:56:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:37,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:56:37,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:56:37,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:37,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:56:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994537353] [2025-01-09 05:56:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994537353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:37,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:37,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:37,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243592131] [2025-01-09 05:56:37,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:37,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:37,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:37,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:37,193 INFO L87 Difference]: Start difference. First operand 29715 states and 42927 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 05:56:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:38,595 INFO L93 Difference]: Finished difference Result 67905 states and 97782 transitions. [2025-01-09 05:56:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 90 [2025-01-09 05:56:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:38,668 INFO L225 Difference]: With dead ends: 67905 [2025-01-09 05:56:38,668 INFO L226 Difference]: Without dead ends: 61215 [2025-01-09 05:56:38,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:56:38,685 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8197 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8197 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:38,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8197 Valid, 4001 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61215 states. [2025-01-09 05:56:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61215 to 36403. [2025-01-09 05:56:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36403 states, 36401 states have (on average 1.4403725172385373) internal successors, (52431), 36402 states have internal predecessors, (52431), 0 states have call successors, (0), 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 05:56:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36403 states to 36403 states and 52431 transitions. [2025-01-09 05:56:39,824 INFO L78 Accepts]: Start accepts. Automaton has 36403 states and 52431 transitions. Word has length 90 [2025-01-09 05:56:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:39,825 INFO L471 AbstractCegarLoop]: Abstraction has 36403 states and 52431 transitions. [2025-01-09 05:56:39,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 05:56:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 36403 states and 52431 transitions. [2025-01-09 05:56:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:56:39,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:39,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:39,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:56:39,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:39,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 54598786, now seen corresponding path program 1 times [2025-01-09 05:56:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:39,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445642991] [2025-01-09 05:56:39,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:39,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:39,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:56:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:56:39,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:39,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:56:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445642991] [2025-01-09 05:56:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445642991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:39,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:39,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230962624] [2025-01-09 05:56:39,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:39,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:39,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:39,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:39,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:39,974 INFO L87 Difference]: Start difference. First operand 36403 states and 52431 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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 05:56:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:41,185 INFO L93 Difference]: Finished difference Result 74593 states and 107286 transitions. [2025-01-09 05:56:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:41,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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 90 [2025-01-09 05:56:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:41,265 INFO L225 Difference]: With dead ends: 74593 [2025-01-09 05:56:41,265 INFO L226 Difference]: Without dead ends: 67903 [2025-01-09 05:56:41,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:56:41,282 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8137 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8137 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:41,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8137 Valid, 4043 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67903 states. [2025-01-09 05:56:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67903 to 43091. [2025-01-09 05:56:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43091 states, 43089 states have (on average 1.437373807700341) internal successors, (61935), 43090 states have internal predecessors, (61935), 0 states have call successors, (0), 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 05:56:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43091 states to 43091 states and 61935 transitions. [2025-01-09 05:56:42,472 INFO L78 Accepts]: Start accepts. Automaton has 43091 states and 61935 transitions. Word has length 90 [2025-01-09 05:56:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:42,472 INFO L471 AbstractCegarLoop]: Abstraction has 43091 states and 61935 transitions. [2025-01-09 05:56:42,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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 05:56:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 43091 states and 61935 transitions. [2025-01-09 05:56:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:56:42,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:42,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:42,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:56:42,477 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:42,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1726334078, now seen corresponding path program 1 times [2025-01-09 05:56:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:42,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076546854] [2025-01-09 05:56:42,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:42,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:56:42,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:56:42,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:42,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:56:42,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:42,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076546854] [2025-01-09 05:56:42,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076546854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:42,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:42,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:56:42,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017811719] [2025-01-09 05:56:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:42,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:56:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:42,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:56:42,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:56:42,626 INFO L87 Difference]: Start difference. First operand 43091 states and 61935 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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 05:56:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:44,147 INFO L93 Difference]: Finished difference Result 81281 states and 116790 transitions. [2025-01-09 05:56:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:56:44,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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 90 [2025-01-09 05:56:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:44,240 INFO L225 Difference]: With dead ends: 81281 [2025-01-09 05:56:44,241 INFO L226 Difference]: Without dead ends: 74591 [2025-01-09 05:56:44,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:56:44,258 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8040 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8040 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:44,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8040 Valid, 4146 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:56:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74591 states. [2025-01-09 05:56:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74591 to 49779. [2025-01-09 05:56:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.4351809068445265) internal successors, (71439), 49778 states have internal predecessors, (71439), 0 states have call successors, (0), 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 05:56:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 71439 transitions. [2025-01-09 05:56:45,529 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 71439 transitions. Word has length 90 [2025-01-09 05:56:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:45,529 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 71439 transitions. [2025-01-09 05:56:45,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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 05:56:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 71439 transitions. [2025-01-09 05:56:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:56:45,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:45,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:45,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:56:45,535 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:45,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash 446172403, now seen corresponding path program 1 times [2025-01-09 05:56:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:45,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778816646] [2025-01-09 05:56:45,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:45,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:56:45,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:56:45,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:45,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778816646] [2025-01-09 05:56:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778816646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62199949] [2025-01-09 05:56:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:45,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:45,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:45,636 INFO L87 Difference]: Start difference. First operand 49779 states and 71439 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:46,941 INFO L93 Difference]: Finished difference Result 98007 states and 140017 transitions. [2025-01-09 05:56:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:46,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 05:56:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:47,012 INFO L225 Difference]: With dead ends: 98007 [2025-01-09 05:56:47,013 INFO L226 Difference]: Without dead ends: 49781 [2025-01-09 05:56:47,044 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 05:56:47,045 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 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 05:56:47,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49781 states. [2025-01-09 05:56:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49781 to 49779. [2025-01-09 05:56:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.421359262309902) internal successors, (70751), 49778 states have internal predecessors, (70751), 0 states have call successors, (0), 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 05:56:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 70751 transitions. [2025-01-09 05:56:48,608 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 70751 transitions. Word has length 91 [2025-01-09 05:56:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:48,608 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 70751 transitions. [2025-01-09 05:56:48,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 70751 transitions. [2025-01-09 05:56:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:56:48,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:48,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:48,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:56:48,611 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:48,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 131060762, now seen corresponding path program 1 times [2025-01-09 05:56:48,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:48,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214220334] [2025-01-09 05:56:48,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:48,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:56:48,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:56:48,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:48,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:48,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214220334] [2025-01-09 05:56:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214220334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040782089] [2025-01-09 05:56:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:48,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:48,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:48,696 INFO L87 Difference]: Start difference. First operand 49779 states and 70751 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 05:56:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:49,015 INFO L93 Difference]: Finished difference Result 67564 states and 95975 transitions. [2025-01-09 05:56:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 05:56:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:49,043 INFO L225 Difference]: With dead ends: 67564 [2025-01-09 05:56:49,044 INFO L226 Difference]: Without dead ends: 19338 [2025-01-09 05:56:49,072 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 05:56:49,072 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 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 05:56:49,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19338 states. [2025-01-09 05:56:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19338 to 19330. [2025-01-09 05:56:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19330 states, 19328 states have (on average 1.4402938741721854) internal successors, (27838), 19329 states have internal predecessors, (27838), 0 states have call successors, (0), 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 05:56:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 27838 transitions. [2025-01-09 05:56:49,637 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 27838 transitions. Word has length 92 [2025-01-09 05:56:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:49,637 INFO L471 AbstractCegarLoop]: Abstraction has 19330 states and 27838 transitions. [2025-01-09 05:56:49,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 05:56:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 27838 transitions. [2025-01-09 05:56:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:56:49,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:49,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:49,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:56:49,639 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:49,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash 172821189, now seen corresponding path program 1 times [2025-01-09 05:56:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723825553] [2025-01-09 05:56:49,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:56:49,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:56:49,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:49,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:49,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:49,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723825553] [2025-01-09 05:56:49,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723825553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:49,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955193442] [2025-01-09 05:56:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:49,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:49,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:49,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:49,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:49,701 INFO L87 Difference]: Start difference. First operand 19330 states and 27838 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:49,847 INFO L93 Difference]: Finished difference Result 28214 states and 40320 transitions. [2025-01-09 05:56:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 05:56:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:49,861 INFO L225 Difference]: With dead ends: 28214 [2025-01-09 05:56:49,861 INFO L226 Difference]: Without dead ends: 10452 [2025-01-09 05:56:49,873 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 05:56:49,874 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 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 05:56:49,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10452 states. [2025-01-09 05:56:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10452 to 10450. [2025-01-09 05:56:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10450 states, 10448 states have (on average 1.4584609494640122) internal successors, (15238), 10449 states have internal predecessors, (15238), 0 states have call successors, (0), 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 05:56:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10450 states to 10450 states and 15238 transitions. [2025-01-09 05:56:50,176 INFO L78 Accepts]: Start accepts. Automaton has 10450 states and 15238 transitions. Word has length 93 [2025-01-09 05:56:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:50,177 INFO L471 AbstractCegarLoop]: Abstraction has 10450 states and 15238 transitions. [2025-01-09 05:56:50,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 10450 states and 15238 transitions. [2025-01-09 05:56:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:56:50,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:50,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:50,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:56:50,178 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:50,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash -150071529, now seen corresponding path program 1 times [2025-01-09 05:56:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:50,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260048395] [2025-01-09 05:56:50,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:50,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:56:50,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:56:50,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:50,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:50,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260048395] [2025-01-09 05:56:50,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260048395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532489478] [2025-01-09 05:56:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:50,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:50,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:50,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:50,242 INFO L87 Difference]: Start difference. First operand 10450 states and 15238 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 05:56:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:50,323 INFO L93 Difference]: Finished difference Result 14894 states and 21420 transitions. [2025-01-09 05:56:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 05:56:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:50,331 INFO L225 Difference]: With dead ends: 14894 [2025-01-09 05:56:50,331 INFO L226 Difference]: Without dead ends: 6012 [2025-01-09 05:56:50,337 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 05:56:50,338 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 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 05:56:50,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-01-09 05:56:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6010. [2025-01-09 05:56:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6010 states, 6008 states have (on average 1.4976697736351532) internal successors, (8998), 6009 states have internal predecessors, (8998), 0 states have call successors, (0), 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 05:56:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 8998 transitions. [2025-01-09 05:56:50,441 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 8998 transitions. Word has length 95 [2025-01-09 05:56:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:50,441 INFO L471 AbstractCegarLoop]: Abstraction has 6010 states and 8998 transitions. [2025-01-09 05:56:50,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 05:56:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 8998 transitions. [2025-01-09 05:56:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:56:50,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:50,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:50,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:56:50,442 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:50,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1004818921, now seen corresponding path program 1 times [2025-01-09 05:56:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470212693] [2025-01-09 05:56:50,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:56:50,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:56:50,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:50,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:50,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470212693] [2025-01-09 05:56:50,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470212693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:50,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:50,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:50,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982654140] [2025-01-09 05:56:50,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:50,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:50,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:50,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:50,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:50,502 INFO L87 Difference]: Start difference. First operand 6010 states and 8998 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 05:56:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:50,554 INFO L93 Difference]: Finished difference Result 8234 states and 12060 transitions. [2025-01-09 05:56:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 05:56:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:50,560 INFO L225 Difference]: With dead ends: 8234 [2025-01-09 05:56:50,560 INFO L226 Difference]: Without dead ends: 3792 [2025-01-09 05:56:50,563 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 05:56:50,564 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 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 05:56:50,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2025-01-09 05:56:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3790. [2025-01-09 05:56:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3788 states have (on average 1.559662090813094) internal successors, (5908), 3789 states have internal predecessors, (5908), 0 states have call successors, (0), 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 05:56:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 5908 transitions. [2025-01-09 05:56:50,627 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 5908 transitions. Word has length 97 [2025-01-09 05:56:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:50,627 INFO L471 AbstractCegarLoop]: Abstraction has 3790 states and 5908 transitions. [2025-01-09 05:56:50,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 05:56:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 5908 transitions. [2025-01-09 05:56:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:56:50,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:50,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:50,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:56:50,629 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:50,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1807801147, now seen corresponding path program 1 times [2025-01-09 05:56:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666862245] [2025-01-09 05:56:50,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:50,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:56:50,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:56:50,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:50,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666862245] [2025-01-09 05:56:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666862245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:56:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:56:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:56:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846525520] [2025-01-09 05:56:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:56:50,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:56:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:50,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:56:50,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:56:50,701 INFO L87 Difference]: Start difference. First operand 3790 states and 5908 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 05:56:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:50,735 INFO L93 Difference]: Finished difference Result 4904 states and 7425 transitions. [2025-01-09 05:56:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:56:50,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 05:56:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:50,740 INFO L225 Difference]: With dead ends: 4904 [2025-01-09 05:56:50,740 INFO L226 Difference]: Without dead ends: 2682 [2025-01-09 05:56:50,742 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 05:56:50,743 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 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 05:56:50,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:56:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2025-01-09 05:56:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2680. [2025-01-09 05:56:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2678 states have (on average 1.6348020911127707) internal successors, (4378), 2679 states have internal predecessors, (4378), 0 states have call successors, (0), 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 05:56:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 4378 transitions. [2025-01-09 05:56:50,779 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 4378 transitions. Word has length 99 [2025-01-09 05:56:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:50,780 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 4378 transitions. [2025-01-09 05:56:50,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 05:56:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 4378 transitions. [2025-01-09 05:56:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:56:50,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:50,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:50,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:56:50,781 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:50,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1552100595, now seen corresponding path program 1 times [2025-01-09 05:56:50,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:50,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016442488] [2025-01-09 05:56:50,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:50,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:50,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:56:50,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:56:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:50,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:51,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:51,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016442488] [2025-01-09 05:56:51,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016442488] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:51,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167012609] [2025-01-09 05:56:51,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:51,350 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 05:56:51,353 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 05:56:51,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:56:51,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:56:51,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:51,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:51,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:56:51,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:51,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167012609] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:53,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:56:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082917527] [2025-01-09 05:56:53,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:53,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:56:53,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:53,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:56:53,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:56:53,199 INFO L87 Difference]: Start difference. First operand 2680 states and 4378 transitions. Second operand has 29 states, 29 states have (on average 9.206896551724139) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 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 05:56:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:55,166 INFO L93 Difference]: Finished difference Result 8274 states and 12035 transitions. [2025-01-09 05:56:55,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 05:56:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.206896551724139) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 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 101 [2025-01-09 05:56:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:55,177 INFO L225 Difference]: With dead ends: 8274 [2025-01-09 05:56:55,178 INFO L226 Difference]: Without dead ends: 7162 [2025-01-09 05:56:55,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=957, Invalid=3735, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 05:56:55,182 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 22678 mSDsluCounter, 6604 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22678 SdHoareTripleChecker+Valid, 8113 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:55,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22678 Valid, 8113 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:56:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7162 states. [2025-01-09 05:56:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7162 to 7090. [2025-01-09 05:56:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7090 states, 7088 states have (on average 1.4493510158013545) internal successors, (10273), 7089 states have internal predecessors, (10273), 0 states have call successors, (0), 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 05:56:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7090 states to 7090 states and 10273 transitions. [2025-01-09 05:56:55,310 INFO L78 Accepts]: Start accepts. Automaton has 7090 states and 10273 transitions. Word has length 101 [2025-01-09 05:56:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:55,311 INFO L471 AbstractCegarLoop]: Abstraction has 7090 states and 10273 transitions. [2025-01-09 05:56:55,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.206896551724139) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 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 05:56:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7090 states and 10273 transitions. [2025-01-09 05:56:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:56:55,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:55,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:55,329 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 05:56:55,517 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,SelfDestructingSolverStorable25 [2025-01-09 05:56:55,517 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1439631538, now seen corresponding path program 1 times [2025-01-09 05:56:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111271562] [2025-01-09 05:56:55,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:56:55,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:56:55,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:55,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:55,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111271562] [2025-01-09 05:56:55,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111271562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:55,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041527689] [2025-01-09 05:56:55,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:55,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:55,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:55,835 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 05:56:55,836 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 05:56:55,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:56:55,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:56:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:55,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:56:55,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:56,349 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 05:56:56,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:57,180 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 05:56:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041527689] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:57,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:56:57,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609097146] [2025-01-09 05:56:57,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:56:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:57,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:56:57,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:56:57,182 INFO L87 Difference]: Start difference. First operand 7090 states and 10273 transitions. Second operand has 25 states, 25 states have (on average 11.12) internal successors, (278), 24 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:56:58,807 INFO L93 Difference]: Finished difference Result 28164 states and 38600 transitions. [2025-01-09 05:56:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 05:56:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.12) internal successors, (278), 24 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-09 05:56:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:56:58,832 INFO L225 Difference]: With dead ends: 28164 [2025-01-09 05:56:58,832 INFO L226 Difference]: Without dead ends: 22642 [2025-01-09 05:56:58,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=588, Invalid=2274, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 05:56:58,845 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 19338 mSDsluCounter, 6546 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19338 SdHoareTripleChecker+Valid, 8056 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:56:58,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19338 Valid, 8056 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:56:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22642 states. [2025-01-09 05:56:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22642 to 22330. [2025-01-09 05:56:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22330 states, 22328 states have (on average 1.351576495879613) internal successors, (30178), 22329 states have internal predecessors, (30178), 0 states have call successors, (0), 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 05:56:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22330 states to 22330 states and 30178 transitions. [2025-01-09 05:56:59,305 INFO L78 Accepts]: Start accepts. Automaton has 22330 states and 30178 transitions. Word has length 102 [2025-01-09 05:56:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:59,305 INFO L471 AbstractCegarLoop]: Abstraction has 22330 states and 30178 transitions. [2025-01-09 05:56:59,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.12) internal successors, (278), 24 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22330 states and 30178 transitions. [2025-01-09 05:56:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 05:56:59,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:59,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:59,325 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 05:56:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 05:56:59,512 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash -323826721, now seen corresponding path program 1 times [2025-01-09 05:56:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:59,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530692449] [2025-01-09 05:56:59,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:59,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:56:59,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:56:59,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:59,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:59,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530692449] [2025-01-09 05:56:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530692449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:59,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724945211] [2025-01-09 05:56:59,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:59,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:59,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:59,838 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 05:56:59,840 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 05:56:59,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:56:59,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:56:59,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:59,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:59,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:56:59,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:57:00,339 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 05:57:00,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:57:01,068 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 05:57:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724945211] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:57:01,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:57:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:57:01,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600502610] [2025-01-09 05:57:01,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:57:01,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:57:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:01,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:57:01,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:57:01,070 INFO L87 Difference]: Start difference. First operand 22330 states and 30178 transitions. Second operand has 25 states, 25 states have (on average 10.92) internal successors, (273), 24 states have internal predecessors, (273), 0 states have call successors, (0), 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 05:57:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:04,200 INFO L93 Difference]: Finished difference Result 111384 states and 147785 transitions. [2025-01-09 05:57:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 05:57:04,200 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.92) internal successors, (273), 24 states have internal predecessors, (273), 0 states have call successors, (0), 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 103 [2025-01-09 05:57:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:04,295 INFO L225 Difference]: With dead ends: 111384 [2025-01-09 05:57:04,295 INFO L226 Difference]: Without dead ends: 90622 [2025-01-09 05:57:04,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=667, Invalid=2413, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:57:04,325 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 23366 mSDsluCounter, 7230 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23366 SdHoareTripleChecker+Valid, 8820 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:04,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23366 Valid, 8820 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:57:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90622 states. [2025-01-09 05:57:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90622 to 89410. [2025-01-09 05:57:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89410 states, 89408 states have (on average 1.2938215819613457) internal successors, (115678), 89409 states have internal predecessors, (115678), 0 states have call successors, (0), 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 05:57:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89410 states to 89410 states and 115678 transitions. [2025-01-09 05:57:06,542 INFO L78 Accepts]: Start accepts. Automaton has 89410 states and 115678 transitions. Word has length 103 [2025-01-09 05:57:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:06,542 INFO L471 AbstractCegarLoop]: Abstraction has 89410 states and 115678 transitions. [2025-01-09 05:57:06,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.92) internal successors, (273), 24 states have internal predecessors, (273), 0 states have call successors, (0), 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 05:57:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 89410 states and 115678 transitions. [2025-01-09 05:57:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:57:06,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:06,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:57:06,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:57:06,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:57:06,749 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:06,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 949141679, now seen corresponding path program 1 times [2025-01-09 05:57:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762269706] [2025-01-09 05:57:06,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:06,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:57:06,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:57:06,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:06,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:07,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762269706] [2025-01-09 05:57:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762269706] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:57:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862457337] [2025-01-09 05:57:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:07,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:57:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:57:07,023 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 05:57:07,024 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 05:57:07,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:57:07,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:57:07,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:07,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 05:57:07,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:57:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:07,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:57:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:08,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862457337] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:57:08,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:57:08,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-01-09 05:57:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913547098] [2025-01-09 05:57:08,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:57:08,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:57:08,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:08,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:57:08,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:57:08,745 INFO L87 Difference]: Start difference. First operand 89410 states and 115678 transitions. Second operand has 29 states, 29 states have (on average 10.172413793103448) internal successors, (295), 29 states have internal predecessors, (295), 0 states have call successors, (0), 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 05:57:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:11,493 INFO L93 Difference]: Finished difference Result 180136 states and 232801 transitions. [2025-01-09 05:57:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 05:57:11,494 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.172413793103448) internal successors, (295), 29 states have internal predecessors, (295), 0 states have call successors, (0), 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 105 [2025-01-09 05:57:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:11,615 INFO L225 Difference]: With dead ends: 180136 [2025-01-09 05:57:11,616 INFO L226 Difference]: Without dead ends: 92294 [2025-01-09 05:57:11,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=440, Invalid=1366, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 05:57:11,678 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 4906 mSDsluCounter, 5179 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4906 SdHoareTripleChecker+Valid, 6709 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:11,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4906 Valid, 6709 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:57:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92294 states. [2025-01-09 05:57:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92294 to 82210. [2025-01-09 05:57:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82210 states, 82208 states have (on average 1.2845221876216426) internal successors, (105598), 82209 states have internal predecessors, (105598), 0 states have call successors, (0), 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 05:57:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82210 states to 82210 states and 105598 transitions. [2025-01-09 05:57:14,292 INFO L78 Accepts]: Start accepts. Automaton has 82210 states and 105598 transitions. Word has length 105 [2025-01-09 05:57:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 82210 states and 105598 transitions. [2025-01-09 05:57:14,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.172413793103448) internal successors, (295), 29 states have internal predecessors, (295), 0 states have call successors, (0), 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 05:57:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 82210 states and 105598 transitions. [2025-01-09 05:57:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 05:57:14,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:14,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:57:14,307 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 05:57:14,501 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,SelfDestructingSolverStorable28 [2025-01-09 05:57:14,501 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:14,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash 344033746, now seen corresponding path program 1 times [2025-01-09 05:57:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797643078] [2025-01-09 05:57:14,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:14,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 05:57:14,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 05:57:14,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:14,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:15,346 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 05:57:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:15,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797643078] [2025-01-09 05:57:15,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797643078] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:57:15,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368659791] [2025-01-09 05:57:15,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:15,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:57:15,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:57:15,349 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 05:57:15,350 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 05:57:15,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 05:57:15,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 05:57:15,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:15,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 05:57:15,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:57:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:16,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:57:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368659791] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:57:17,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:57:17,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2025-01-09 05:57:17,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579175451] [2025-01-09 05:57:17,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:57:17,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 05:57:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:17,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 05:57:17,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1303, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 05:57:17,891 INFO L87 Difference]: Start difference. First operand 82210 states and 105598 transitions. Second operand has 39 states, 39 states have (on average 7.743589743589744) internal successors, (302), 39 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:57:22,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:22,475 INFO L93 Difference]: Finished difference Result 115380 states and 147911 transitions. [2025-01-09 05:57:22,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-09 05:57:22,476 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.743589743589744) internal successors, (302), 39 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-01-09 05:57:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:22,581 INFO L225 Difference]: With dead ends: 115380 [2025-01-09 05:57:22,581 INFO L226 Difference]: Without dead ends: 83122 [2025-01-09 05:57:22,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1579, Invalid=5561, Unknown=0, NotChecked=0, Total=7140 [2025-01-09 05:57:22,606 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 9691 mSDsluCounter, 21791 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9691 SdHoareTripleChecker+Valid, 23324 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:22,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9691 Valid, 23324 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:57:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83122 states. [2025-01-09 05:57:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83122 to 72738. [2025-01-09 05:57:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72738 states, 72736 states have (on average 1.2819786625604928) internal successors, (93246), 72737 states have internal predecessors, (93246), 0 states have call successors, (0), 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 05:57:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72738 states to 72738 states and 93246 transitions. [2025-01-09 05:57:24,795 INFO L78 Accepts]: Start accepts. Automaton has 72738 states and 93246 transitions. Word has length 106 [2025-01-09 05:57:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:24,795 INFO L471 AbstractCegarLoop]: Abstraction has 72738 states and 93246 transitions. [2025-01-09 05:57:24,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.743589743589744) internal successors, (302), 39 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:57:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 72738 states and 93246 transitions. [2025-01-09 05:57:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 05:57:24,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:24,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:57:24,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 05:57:25,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:57:25,005 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:25,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:25,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1934066478, now seen corresponding path program 1 times [2025-01-09 05:57:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972116194] [2025-01-09 05:57:25,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:25,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 05:57:25,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 05:57:25,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:25,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972116194] [2025-01-09 05:57:25,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972116194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:57:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665671050] [2025-01-09 05:57:25,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:25,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:57:25,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:57:25,711 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 05:57:25,715 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 05:57:25,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 05:57:25,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 05:57:25,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:25,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:25,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 05:57:25,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:57:26,754 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 05:57:26,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:57:28,119 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 05:57:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665671050] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:57:28,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:57:28,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 17] total 41 [2025-01-09 05:57:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075924499] [2025-01-09 05:57:28,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:57:28,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 05:57:28,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:28,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 05:57:28,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 05:57:28,122 INFO L87 Difference]: Start difference. First operand 72738 states and 93246 transitions. Second operand has 41 states, 41 states have (on average 6.878048780487805) internal successors, (282), 41 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)