./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.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.ufo.BOUNDED-12.pals+Problem12_label06.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 1b5bedda6fafe9d5e27c46cd442327641e760ea4d9632bf3cdc5cb7e6cff3dd5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:54:45,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:54:45,849 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:54:45,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:54:45,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:54:45,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:54:45,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:54:45,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:54:45,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:54:45,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:54:45,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:54:45,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:54:45,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:54:45,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:54:45,870 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:54:45,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:54:45,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:54:45,870 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:54:45,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:54:45,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:54:45,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:54:45,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:54:45,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:54:45,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:54:45,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:54:45,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:54:45,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:54:45,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:54:45,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:54:45,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:54:45,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:54:45,876 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 -> 1b5bedda6fafe9d5e27c46cd442327641e760ea4d9632bf3cdc5cb7e6cff3dd5 [2025-01-09 05:54:46,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:54:46,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:54:46,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:54:46,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:54:46,145 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:54:46,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c [2025-01-09 05:54:47,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cabe5869/0506c73bef314e5085020f8f23e65f5d/FLAG5f2ffdd3c [2025-01-09 05:54:47,918 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:54:47,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c [2025-01-09 05:54:47,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cabe5869/0506c73bef314e5085020f8f23e65f5d/FLAG5f2ffdd3c [2025-01-09 05:54:48,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cabe5869/0506c73bef314e5085020f8f23e65f5d [2025-01-09 05:54:48,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:54:48,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:54:48,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:54:48,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:54:48,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:54:48,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:54:48" (1/1) ... [2025-01-09 05:54:48,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557ea9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:48, skipping insertion in model container [2025-01-09 05:54:48,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:54:48" (1/1) ... [2025-01-09 05:54:48,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:54:48,403 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.ufo.BOUNDED-12.pals+Problem12_label06.c[15482,15495] [2025-01-09 05:54:48,462 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.ufo.BOUNDED-12.pals+Problem12_label06.c[18299,18312] [2025-01-09 05:54:48,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:54:48,851 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:54:48,889 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.ufo.BOUNDED-12.pals+Problem12_label06.c[15482,15495] [2025-01-09 05:54:48,894 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.ufo.BOUNDED-12.pals+Problem12_label06.c[18299,18312] [2025-01-09 05:54:49,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:54:49,140 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:54:49,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49 WrapperNode [2025-01-09 05:54:49,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:54:49,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:54:49,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:54:49,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:54:49,147 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:54:49" (1/1) ... [2025-01-09 05:54:49,178 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:54:49" (1/1) ... [2025-01-09 05:54:49,495 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5153 [2025-01-09 05:54:49,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:54:49,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:54:49,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:54:49,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:54:49,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,665 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:54:49,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:54:49,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:54:49,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:54:49,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:54:49,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:54:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:49,986 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:54:49,991 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:54:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:54:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:54:50,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:54:50,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:54:50,114 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:54:50,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:54:53,691 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:54:53,692 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:54:53,712 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:54:53,712 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:54:53,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:54:53 BoogieIcfgContainer [2025-01-09 05:54:53,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:54:53,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:54:53,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:54:53,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:54:53,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:54:48" (1/3) ... [2025-01-09 05:54:53,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630dbff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:54:53, skipping insertion in model container [2025-01-09 05:54:53,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49" (2/3) ... [2025-01-09 05:54:53,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630dbff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:54:53, skipping insertion in model container [2025-01-09 05:54:53,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:54:53" (3/3) ... [2025-01-09 05:54:53,720 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c [2025-01-09 05:54:53,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:54:53,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:54:53,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:54:53,787 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;@764ab22f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:54:53,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:54:53,792 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:54:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:54:53,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:53,796 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] [2025-01-09 05:54:53,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 46189136, now seen corresponding path program 1 times [2025-01-09 05:54:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767486727] [2025-01-09 05:54:53,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:53,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:54:53,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:54:53,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:53,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:54,002 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:54:54,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:54,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767486727] [2025-01-09 05:54:54,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767486727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:54,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:54,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:54:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196800554] [2025-01-09 05:54:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:54,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:54,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:54,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:54,021 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 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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:54:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:56,843 INFO L93 Difference]: Finished difference Result 2535 states and 4877 transitions. [2025-01-09 05:54:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-09 05:54:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:56,860 INFO L225 Difference]: With dead ends: 2535 [2025-01-09 05:54:56,860 INFO L226 Difference]: Without dead ends: 1599 [2025-01-09 05:54:56,865 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:54:56,867 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 976 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:56,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 648 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 05:54:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-01-09 05:54:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-01-09 05:54:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.646211646837821) internal successors, (2629), 1598 states have internal predecessors, (2629), 0 states have call successors, (0), 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:54:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2629 transitions. [2025-01-09 05:54:56,957 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2629 transitions. Word has length 24 [2025-01-09 05:54:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:56,957 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2629 transitions. [2025-01-09 05:54:56,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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:54:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2629 transitions. [2025-01-09 05:54:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:54:56,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:56,961 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:54:56,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:54:56,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:56,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash -39335136, now seen corresponding path program 1 times [2025-01-09 05:54:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184144140] [2025-01-09 05:54:56,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:56,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:54:56,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:54:56,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:56,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:57,170 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:54:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184144140] [2025-01-09 05:54:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184144140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:54:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487099504] [2025-01-09 05:54:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:57,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:54:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:57,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:54:57,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:57,172 INFO L87 Difference]: Start difference. First operand 1599 states and 2629 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:54:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:57,302 INFO L93 Difference]: Finished difference Result 1651 states and 2710 transitions. [2025-01-09 05:54:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:54:57,303 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:54:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:57,313 INFO L225 Difference]: With dead ends: 1651 [2025-01-09 05:54:57,313 INFO L226 Difference]: Without dead ends: 1599 [2025-01-09 05:54:57,314 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:54:57,315 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:54:57,315 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:54:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-01-09 05:54:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-01-09 05:54:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.6211646837820914) internal successors, (2589), 1598 states have internal predecessors, (2589), 0 states have call successors, (0), 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:54:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2589 transitions. [2025-01-09 05:54:57,358 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2589 transitions. Word has length 26 [2025-01-09 05:54:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:57,358 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2589 transitions. [2025-01-09 05:54:57,358 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:54:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2589 transitions. [2025-01-09 05:54:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:54:57,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:57,360 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:54:57,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:54:57,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:57,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1783115668, now seen corresponding path program 1 times [2025-01-09 05:54:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271415766] [2025-01-09 05:54:57,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:57,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:54:57,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:54:57,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:57,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:57,559 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:54:57,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271415766] [2025-01-09 05:54:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271415766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434554016] [2025-01-09 05:54:57,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:57,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:57,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:57,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:57,561 INFO L87 Difference]: Start difference. First operand 1599 states and 2589 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:54:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:57,806 INFO L93 Difference]: Finished difference Result 2175 states and 3513 transitions. [2025-01-09 05:54:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:54:57,807 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:54:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:57,814 INFO L225 Difference]: With dead ends: 2175 [2025-01-09 05:54:57,815 INFO L226 Difference]: Without dead ends: 2127 [2025-01-09 05:54:57,815 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:54:57,816 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:54:57,816 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:54:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-01-09 05:54:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1645. [2025-01-09 05:54:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.620815581253804) internal successors, (2663), 1644 states have internal predecessors, (2663), 0 states have call successors, (0), 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:54:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2663 transitions. [2025-01-09 05:54:57,848 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2663 transitions. Word has length 65 [2025-01-09 05:54:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:57,848 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2663 transitions. [2025-01-09 05:54:57,848 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:54:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2663 transitions. [2025-01-09 05:54:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:54:57,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:57,850 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:54:57,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:54:57,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:57,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:57,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1297900228, now seen corresponding path program 1 times [2025-01-09 05:54:57,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131652398] [2025-01-09 05:54:57,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:57,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:54:57,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:54:57,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:57,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:57,913 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:54:57,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:57,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131652398] [2025-01-09 05:54:57,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131652398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:57,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:57,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670922116] [2025-01-09 05:54:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:57,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:57,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:57,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:57,915 INFO L87 Difference]: Start difference. First operand 1645 states and 2663 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:54:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:57,940 INFO L93 Difference]: Finished difference Result 1822 states and 2946 transitions. [2025-01-09 05:54:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:57,940 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:54:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:57,946 INFO L225 Difference]: With dead ends: 1822 [2025-01-09 05:54:57,946 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:54:57,946 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:54:57,947 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:54:57,947 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:54:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:54:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:54:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.618909512761021) internal successors, (2791), 1725 states have internal predecessors, (2791), 0 states have call successors, (0), 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:54:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2791 transitions. [2025-01-09 05:54:57,977 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2791 transitions. Word has length 67 [2025-01-09 05:54:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2791 transitions. [2025-01-09 05:54:57,978 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:54:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2791 transitions. [2025-01-09 05:54:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:54:57,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:57,979 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:54:57,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:54:57,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:57,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1231406716, now seen corresponding path program 1 times [2025-01-09 05:54:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084859340] [2025-01-09 05:54:57,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:57,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:54:57,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:54:57,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:57,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:58,364 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:54:58,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084859340] [2025-01-09 05:54:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084859340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:58,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210135853] [2025-01-09 05:54:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:58,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:58,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:58,365 INFO L87 Difference]: Start difference. First operand 1726 states and 2791 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:54:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:58,691 INFO L93 Difference]: Finished difference Result 1903 states and 3071 transitions. [2025-01-09 05:54:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:58,692 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:54:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:58,697 INFO L225 Difference]: With dead ends: 1903 [2025-01-09 05:54:58,697 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:54:58,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:54:58,699 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 4516 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:58,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 1922 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:54:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:54:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6177494199535962) internal successors, (2789), 1725 states have internal predecessors, (2789), 0 states have call successors, (0), 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:54:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2789 transitions. [2025-01-09 05:54:58,725 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2789 transitions. Word has length 67 [2025-01-09 05:54:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:58,725 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2789 transitions. [2025-01-09 05:54:58,726 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:54:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2789 transitions. [2025-01-09 05:54:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:54:58,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:58,727 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:54:58,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:54:58,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:58,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 66374464, now seen corresponding path program 1 times [2025-01-09 05:54:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943323095] [2025-01-09 05:54:58,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:58,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:54:58,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:54:58,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:58,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:58,984 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:54:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:58,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943323095] [2025-01-09 05:54:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943323095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:58,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:58,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:54:58,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010171778] [2025-01-09 05:54:58,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:58,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:54:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:58,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:54:58,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:58,989 INFO L87 Difference]: Start difference. First operand 1726 states and 2789 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:54:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,024 INFO L93 Difference]: Finished difference Result 1734 states and 2798 transitions. [2025-01-09 05:54:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:54:59,025 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:54:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,033 INFO L225 Difference]: With dead ends: 1734 [2025-01-09 05:54:59,033 INFO L226 Difference]: Without dead ends: 1732 [2025-01-09 05:54:59,034 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:54:59,035 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:54:59,035 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:54:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-01-09 05:54:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2025-01-09 05:54:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.615028901734104) internal successors, (2794), 1731 states have internal predecessors, (2794), 0 states have call successors, (0), 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:54:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2794 transitions. [2025-01-09 05:54:59,097 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2794 transitions. Word has length 68 [2025-01-09 05:54:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,099 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2794 transitions. [2025-01-09 05:54:59,099 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:54:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2794 transitions. [2025-01-09 05:54:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:59,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,100 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:54:59,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:54:59,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2026826780, now seen corresponding path program 1 times [2025-01-09 05:54:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860062287] [2025-01-09 05:54:59,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:59,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:59,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,219 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:54:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860062287] [2025-01-09 05:54:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860062287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877591045] [2025-01-09 05:54:59,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:59,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:59,220 INFO L87 Difference]: Start difference. First operand 1732 states and 2794 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:54:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,249 INFO L93 Difference]: Finished difference Result 1926 states and 3095 transitions. [2025-01-09 05:54:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:59,249 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:54:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,255 INFO L225 Difference]: With dead ends: 1926 [2025-01-09 05:54:59,255 INFO L226 Difference]: Without dead ends: 1826 [2025-01-09 05:54:59,255 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:54:59,257 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:54:59,257 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:54:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-01-09 05:54:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2025-01-09 05:54:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 1.610867178924259) internal successors, (2935), 1823 states have internal predecessors, (2935), 0 states have call successors, (0), 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:54:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2935 transitions. [2025-01-09 05:54:59,288 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2935 transitions. Word has length 69 [2025-01-09 05:54:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,289 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2935 transitions. [2025-01-09 05:54:59,289 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:54:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2935 transitions. [2025-01-09 05:54:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:59,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,290 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:54:59,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:54:59,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1863912220, now seen corresponding path program 1 times [2025-01-09 05:54:59,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675219222] [2025-01-09 05:54:59,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,341 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:54:59,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675219222] [2025-01-09 05:54:59,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675219222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967704101] [2025-01-09 05:54:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:59,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:59,342 INFO L87 Difference]: Start difference. First operand 1824 states and 2935 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:54:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,368 INFO L93 Difference]: Finished difference Result 2342 states and 3735 transitions. [2025-01-09 05:54:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:59,368 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:54:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,374 INFO L225 Difference]: With dead ends: 2342 [2025-01-09 05:54:59,375 INFO L226 Difference]: Without dead ends: 2071 [2025-01-09 05:54:59,376 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:54:59,376 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:54:59,376 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:54:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-01-09 05:54:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2069. [2025-01-09 05:54:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2067 states have (on average 1.5999032414126755) internal successors, (3307), 2068 states have internal predecessors, (3307), 0 states have call successors, (0), 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:54:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3307 transitions. [2025-01-09 05:54:59,412 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3307 transitions. Word has length 69 [2025-01-09 05:54:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,412 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3307 transitions. [2025-01-09 05:54:59,412 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:54:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3307 transitions. [2025-01-09 05:54:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:59,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,413 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:54:59,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:54:59,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1600055836, now seen corresponding path program 1 times [2025-01-09 05:54:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960524534] [2025-01-09 05:54:59,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:59,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:59,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,461 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:54:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960524534] [2025-01-09 05:54:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960524534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520980453] [2025-01-09 05:54:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:59,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:59,462 INFO L87 Difference]: Start difference. First operand 2069 states and 3307 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:54:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,495 INFO L93 Difference]: Finished difference Result 3053 states and 4809 transitions. [2025-01-09 05:54:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:59,495 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:54:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,537 INFO L225 Difference]: With dead ends: 3053 [2025-01-09 05:54:59,537 INFO L226 Difference]: Without dead ends: 2537 [2025-01-09 05:54:59,538 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:54:59,539 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:54:59,539 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:54:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-01-09 05:54:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-01-09 05:54:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2533 states have (on average 1.5803395183576787) internal successors, (4003), 2534 states have internal predecessors, (4003), 0 states have call successors, (0), 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:54:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 4003 transitions. [2025-01-09 05:54:59,587 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 4003 transitions. Word has length 69 [2025-01-09 05:54:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,587 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 4003 transitions. [2025-01-09 05:54:59,587 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:54:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 4003 transitions. [2025-01-09 05:54:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:59,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,588 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:54:59,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:54:59,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,588 INFO L85 PathProgramCache]: Analyzing trace with hash -361793820, now seen corresponding path program 1 times [2025-01-09 05:54:59,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452569104] [2025-01-09 05:54:59,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:59,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:59,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,634 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:54:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452569104] [2025-01-09 05:54:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452569104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850789880] [2025-01-09 05:54:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:59,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:59,635 INFO L87 Difference]: Start difference. First operand 2535 states and 4003 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:54:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,673 INFO L93 Difference]: Finished difference Result 4403 states and 6813 transitions. [2025-01-09 05:54:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:59,673 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:54:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,683 INFO L225 Difference]: With dead ends: 4403 [2025-01-09 05:54:59,683 INFO L226 Difference]: Without dead ends: 3421 [2025-01-09 05:54:59,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:59,686 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:54:59,686 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:54:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-01-09 05:54:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3419. [2025-01-09 05:54:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.5507755340942346) internal successors, (5299), 3418 states have internal predecessors, (5299), 0 states have call successors, (0), 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:54:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5299 transitions. [2025-01-09 05:54:59,749 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5299 transitions. Word has length 69 [2025-01-09 05:54:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,750 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5299 transitions. [2025-01-09 05:54:59,750 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:54:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5299 transitions. [2025-01-09 05:54:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:59,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,750 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:54:59,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:54:59,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash -796329756, now seen corresponding path program 1 times [2025-01-09 05:54:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938788202] [2025-01-09 05:54:59,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:59,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:59,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,793 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:54:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938788202] [2025-01-09 05:54:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938788202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569271990] [2025-01-09 05:54:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:59,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:59,794 INFO L87 Difference]: Start difference. First operand 3419 states and 5299 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:54:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,848 INFO L93 Difference]: Finished difference Result 6959 states and 10533 transitions. [2025-01-09 05:54:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:59,848 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:54:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,862 INFO L225 Difference]: With dead ends: 6959 [2025-01-09 05:54:59,863 INFO L226 Difference]: Without dead ends: 5093 [2025-01-09 05:54:59,865 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:54:59,866 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:54:59,866 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:54:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2025-01-09 05:54:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 5091. [2025-01-09 05:54:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 5089 states have (on average 1.5128708980153271) internal successors, (7699), 5090 states have internal predecessors, (7699), 0 states have call successors, (0), 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:54:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 7699 transitions. [2025-01-09 05:54:59,962 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 7699 transitions. Word has length 69 [2025-01-09 05:54:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,962 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 7699 transitions. [2025-01-09 05:54:59,962 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:54:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 7699 transitions. [2025-01-09 05:54:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:59,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,963 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:54:59,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:54:59,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1717704676, now seen corresponding path program 1 times [2025-01-09 05:54:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695101707] [2025-01-09 05:54:59,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:59,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:59,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,060 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:55:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695101707] [2025-01-09 05:55:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695101707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948050558] [2025-01-09 05:55:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:00,062 INFO L87 Difference]: Start difference. First operand 5091 states and 7699 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:55:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,137 INFO L93 Difference]: Finished difference Result 11783 states and 17397 transitions. [2025-01-09 05:55:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:00,138 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:55:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,152 INFO L225 Difference]: With dead ends: 11783 [2025-01-09 05:55:00,152 INFO L226 Difference]: Without dead ends: 8245 [2025-01-09 05:55:00,157 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:55:00,158 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:55:00,158 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:55:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2025-01-09 05:55:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 8243. [2025-01-09 05:55:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8243 states, 8241 states have (on average 1.4700885814828297) internal successors, (12115), 8242 states have internal predecessors, (12115), 0 states have call successors, (0), 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:55:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 12115 transitions. [2025-01-09 05:55:00,315 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 12115 transitions. Word has length 69 [2025-01-09 05:55:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:00,315 INFO L471 AbstractCegarLoop]: Abstraction has 8243 states and 12115 transitions. [2025-01-09 05:55:00,315 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:55:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 12115 transitions. [2025-01-09 05:55:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:00,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:00,318 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:55:00,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:55:00,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:00,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1175898238, now seen corresponding path program 1 times [2025-01-09 05:55:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376428888] [2025-01-09 05:55:00,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:00,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:00,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:00,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:00,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,582 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:55:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376428888] [2025-01-09 05:55:00,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376428888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:00,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751005214] [2025-01-09 05:55:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:00,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:00,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:00,587 INFO L87 Difference]: Start difference. First operand 8243 states and 12115 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:55:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:01,313 INFO L93 Difference]: Finished difference Result 47841 states and 68890 transitions. [2025-01-09 05:55:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:01,313 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:55:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:01,390 INFO L225 Difference]: With dead ends: 47841 [2025-01-09 05:55:01,390 INFO L226 Difference]: Without dead ends: 43103 [2025-01-09 05:55:01,403 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:55:01,404 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:01,404 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.2s Time] [2025-01-09 05:55:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43103 states. [2025-01-09 05:55:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43103 to 13971. [2025-01-09 05:55:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13971 states, 13969 states have (on average 1.4491373756174386) internal successors, (20243), 13970 states have internal predecessors, (20243), 0 states have call successors, (0), 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:55:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13971 states to 13971 states and 20243 transitions. [2025-01-09 05:55:02,118 INFO L78 Accepts]: Start accepts. Automaton has 13971 states and 20243 transitions. Word has length 90 [2025-01-09 05:55:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:02,118 INFO L471 AbstractCegarLoop]: Abstraction has 13971 states and 20243 transitions. [2025-01-09 05:55:02,119 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:55:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 13971 states and 20243 transitions. [2025-01-09 05:55:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:02,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:02,127 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:55:02,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:55:02,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:02,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1012983678, now seen corresponding path program 1 times [2025-01-09 05:55:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239421940] [2025-01-09 05:55:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:02,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:02,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:02,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:02,325 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:55:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:02,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239421940] [2025-01-09 05:55:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239421940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:02,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326880833] [2025-01-09 05:55:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:02,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:02,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:02,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:02,327 INFO L87 Difference]: Start difference. First operand 13971 states and 20243 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:55:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:03,394 INFO L93 Difference]: Finished difference Result 54529 states and 78426 transitions. [2025-01-09 05:55:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:03,395 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:55:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:03,598 INFO L225 Difference]: With dead ends: 54529 [2025-01-09 05:55:03,599 INFO L226 Difference]: Without dead ends: 47839 [2025-01-09 05:55:03,635 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:55:03,636 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:55:03,636 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:55:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47839 states. [2025-01-09 05:55:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47839 to 23027. [2025-01-09 05:55:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23027 states, 23025 states have (on average 1.4364820846905537) internal successors, (33075), 23026 states have internal predecessors, (33075), 0 states have call successors, (0), 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:55:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23027 states to 23027 states and 33075 transitions. [2025-01-09 05:55:04,383 INFO L78 Accepts]: Start accepts. Automaton has 23027 states and 33075 transitions. Word has length 90 [2025-01-09 05:55:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:04,384 INFO L471 AbstractCegarLoop]: Abstraction has 23027 states and 33075 transitions. [2025-01-09 05:55:04,384 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:55:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23027 states and 33075 transitions. [2025-01-09 05:55:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:04,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:04,388 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:55:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:55:04,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash -749127294, now seen corresponding path program 1 times [2025-01-09 05:55:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661165501] [2025-01-09 05:55:04,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:04,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:04,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:04,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:04,549 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:55:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:04,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661165501] [2025-01-09 05:55:04,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661165501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:04,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:04,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:04,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060639390] [2025-01-09 05:55:04,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:04,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:04,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:04,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:04,551 INFO L87 Difference]: Start difference. First operand 23027 states and 33075 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:55:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:05,460 INFO L93 Difference]: Finished difference Result 61217 states and 87930 transitions. [2025-01-09 05:55:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:05,461 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:55:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:05,648 INFO L225 Difference]: With dead ends: 61217 [2025-01-09 05:55:05,648 INFO L226 Difference]: Without dead ends: 54527 [2025-01-09 05:55:05,685 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:55:05,689 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:55:05,689 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:55:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54527 states. [2025-01-09 05:55:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54527 to 29715. [2025-01-09 05:55:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29715 states, 29713 states have (on average 1.4330091205869484) internal successors, (42579), 29714 states have internal predecessors, (42579), 0 states have call successors, (0), 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:55:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29715 states to 29715 states and 42579 transitions. [2025-01-09 05:55:06,775 INFO L78 Accepts]: Start accepts. Automaton has 29715 states and 42579 transitions. Word has length 90 [2025-01-09 05:55:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:06,775 INFO L471 AbstractCegarLoop]: Abstraction has 29715 states and 42579 transitions. [2025-01-09 05:55:06,776 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:55:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 29715 states and 42579 transitions. [2025-01-09 05:55:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:06,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:06,780 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:55:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:55:06,780 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:06,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 489134722, now seen corresponding path program 1 times [2025-01-09 05:55:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820793859] [2025-01-09 05:55:06,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:06,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:06,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:06,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:06,912 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:55:06,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:06,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820793859] [2025-01-09 05:55:06,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820793859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:06,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:06,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942235556] [2025-01-09 05:55:06,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:06,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:06,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:06,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:06,914 INFO L87 Difference]: Start difference. First operand 29715 states and 42579 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:55:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:08,169 INFO L93 Difference]: Finished difference Result 67905 states and 97434 transitions. [2025-01-09 05:55:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:08,170 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:55:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:08,314 INFO L225 Difference]: With dead ends: 67905 [2025-01-09 05:55:08,315 INFO L226 Difference]: Without dead ends: 61215 [2025-01-09 05:55:08,350 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:55:08,351 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8199 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8199 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:08,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8199 Valid, 3982 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61215 states. [2025-01-09 05:55:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61215 to 36403. [2025-01-09 05:55:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36403 states, 36401 states have (on average 1.4308123403203208) internal successors, (52083), 36402 states have internal predecessors, (52083), 0 states have call successors, (0), 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:55:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36403 states to 36403 states and 52083 transitions. [2025-01-09 05:55:09,836 INFO L78 Accepts]: Start accepts. Automaton has 36403 states and 52083 transitions. Word has length 90 [2025-01-09 05:55:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:09,840 INFO L471 AbstractCegarLoop]: Abstraction has 36403 states and 52083 transitions. [2025-01-09 05:55:09,840 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:55:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 36403 states and 52083 transitions. [2025-01-09 05:55:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:09,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:09,853 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:55:09,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:55:09,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:09,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash 54598786, now seen corresponding path program 1 times [2025-01-09 05:55:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:09,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768406099] [2025-01-09 05:55:09,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:09,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:09,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:09,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:09,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:09,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:10,237 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:55:10,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768406099] [2025-01-09 05:55:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768406099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:10,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830116454] [2025-01-09 05:55:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:10,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:10,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:10,238 INFO L87 Difference]: Start difference. First operand 36403 states and 52083 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:55:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:11,798 INFO L93 Difference]: Finished difference Result 74593 states and 106938 transitions. [2025-01-09 05:55:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:11,799 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:55:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:11,875 INFO L225 Difference]: With dead ends: 74593 [2025-01-09 05:55:11,875 INFO L226 Difference]: Without dead ends: 67903 [2025-01-09 05:55:11,890 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:55:11,890 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:11,890 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.2s Time] [2025-01-09 05:55:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67903 states. [2025-01-09 05:55:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67903 to 43091. [2025-01-09 05:55:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43091 states, 43089 states have (on average 1.429297500522175) internal successors, (61587), 43090 states have internal predecessors, (61587), 0 states have call successors, (0), 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:55:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43091 states to 43091 states and 61587 transitions. [2025-01-09 05:55:13,285 INFO L78 Accepts]: Start accepts. Automaton has 43091 states and 61587 transitions. Word has length 90 [2025-01-09 05:55:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 43091 states and 61587 transitions. [2025-01-09 05:55:13,286 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:55:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 43091 states and 61587 transitions. [2025-01-09 05:55:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:13,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:13,290 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:55:13,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:55:13,290 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:13,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1726334078, now seen corresponding path program 1 times [2025-01-09 05:55:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:13,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070569977] [2025-01-09 05:55:13,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:13,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:13,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:13,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:13,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:13,534 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:55:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070569977] [2025-01-09 05:55:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070569977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:13,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294830129] [2025-01-09 05:55:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:13,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:13,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:13,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:13,537 INFO L87 Difference]: Start difference. First operand 43091 states and 61587 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:55:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:14,799 INFO L93 Difference]: Finished difference Result 81281 states and 116442 transitions. [2025-01-09 05:55:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:14,799 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:55:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:14,893 INFO L225 Difference]: With dead ends: 81281 [2025-01-09 05:55:14,893 INFO L226 Difference]: Without dead ends: 74591 [2025-01-09 05:55:14,911 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:55:14,912 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:55:14,912 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:55:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74591 states. [2025-01-09 05:55:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74591 to 49779. [2025-01-09 05:55:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.4281897261787573) internal successors, (71091), 49778 states have internal predecessors, (71091), 0 states have call successors, (0), 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:55:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 71091 transitions. [2025-01-09 05:55:16,264 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 71091 transitions. Word has length 90 [2025-01-09 05:55:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:16,264 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 71091 transitions. [2025-01-09 05:55:16,264 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:55:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 71091 transitions. [2025-01-09 05:55:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:55:16,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:16,276 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:55:16,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:55:16,276 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:16,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash 446172403, now seen corresponding path program 1 times [2025-01-09 05:55:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837310039] [2025-01-09 05:55:16,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:16,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:55:16,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:55:16,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:16,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:16,358 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:55:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837310039] [2025-01-09 05:55:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837310039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:16,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:16,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522931697] [2025-01-09 05:55:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:16,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:16,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:16,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:16,360 INFO L87 Difference]: Start difference. First operand 49779 states and 71091 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:55:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:17,512 INFO L93 Difference]: Finished difference Result 98007 states and 139669 transitions. [2025-01-09 05:55:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:17,513 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:55:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:17,568 INFO L225 Difference]: With dead ends: 98007 [2025-01-09 05:55:17,568 INFO L226 Difference]: Without dead ends: 49781 [2025-01-09 05:55:17,586 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:55:17,591 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:55:17,591 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:55:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49781 states. [2025-01-09 05:55:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49781 to 49779. [2025-01-09 05:55:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.4143680816441329) internal successors, (70403), 49778 states have internal predecessors, (70403), 0 states have call successors, (0), 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:55:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 70403 transitions. [2025-01-09 05:55:18,705 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 70403 transitions. Word has length 91 [2025-01-09 05:55:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:18,706 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 70403 transitions. [2025-01-09 05:55:18,706 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:55:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 70403 transitions. [2025-01-09 05:55:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:55:18,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:18,709 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:55:18,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:55:18,709 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:18,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 131060762, now seen corresponding path program 1 times [2025-01-09 05:55:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66304355] [2025-01-09 05:55:18,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:18,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:55:18,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:55:18,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:18,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:18,775 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:55:18,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66304355] [2025-01-09 05:55:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66304355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470079974] [2025-01-09 05:55:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:18,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:18,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:18,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:18,777 INFO L87 Difference]: Start difference. First operand 49779 states and 70403 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:55:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,196 INFO L93 Difference]: Finished difference Result 67564 states and 95627 transitions. [2025-01-09 05:55:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:19,197 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:55:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,221 INFO L225 Difference]: With dead ends: 67564 [2025-01-09 05:55:19,222 INFO L226 Difference]: Without dead ends: 19338 [2025-01-09 05:55:19,252 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:55:19,255 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:55:19,255 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:55:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19338 states. [2025-01-09 05:55:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19338 to 19330. [2025-01-09 05:55:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19330 states, 19328 states have (on average 1.4222889072847682) internal successors, (27490), 19329 states have internal predecessors, (27490), 0 states have call successors, (0), 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:55:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 27490 transitions. [2025-01-09 05:55:19,798 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 27490 transitions. Word has length 92 [2025-01-09 05:55:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:19,800 INFO L471 AbstractCegarLoop]: Abstraction has 19330 states and 27490 transitions. [2025-01-09 05:55:19,800 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:55:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 27490 transitions. [2025-01-09 05:55:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:55:19,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:19,802 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:55:19,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:55:19,802 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:19,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:19,803 INFO L85 PathProgramCache]: Analyzing trace with hash 172821189, now seen corresponding path program 1 times [2025-01-09 05:55:19,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:19,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349199294] [2025-01-09 05:55:19,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:19,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:55:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:55:19,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:19,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:19,857 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:55:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349199294] [2025-01-09 05:55:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349199294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:19,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:19,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229667617] [2025-01-09 05:55:19,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:19,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:19,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:19,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:19,859 INFO L87 Difference]: Start difference. First operand 19330 states and 27490 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:55:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:20,001 INFO L93 Difference]: Finished difference Result 28214 states and 39972 transitions. [2025-01-09 05:55:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:20,001 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:55:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:20,015 INFO L225 Difference]: With dead ends: 28214 [2025-01-09 05:55:20,015 INFO L226 Difference]: Without dead ends: 10452 [2025-01-09 05:55:20,028 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:55:20,029 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:55:20,029 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:55:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10452 states. [2025-01-09 05:55:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10452 to 10450. [2025-01-09 05:55:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10450 states, 10448 states have (on average 1.4251531393568146) internal successors, (14890), 10449 states have internal predecessors, (14890), 0 states have call successors, (0), 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:55:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10450 states to 10450 states and 14890 transitions. [2025-01-09 05:55:20,327 INFO L78 Accepts]: Start accepts. Automaton has 10450 states and 14890 transitions. Word has length 93 [2025-01-09 05:55:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:20,327 INFO L471 AbstractCegarLoop]: Abstraction has 10450 states and 14890 transitions. [2025-01-09 05:55:20,327 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:55:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 10450 states and 14890 transitions. [2025-01-09 05:55:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:55:20,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:20,329 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:55:20,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:55:20,329 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:20,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash -150071529, now seen corresponding path program 1 times [2025-01-09 05:55:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:20,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041986108] [2025-01-09 05:55:20,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:20,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:55:20,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:55:20,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:20,467 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:55:20,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041986108] [2025-01-09 05:55:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041986108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:20,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:20,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:20,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911168777] [2025-01-09 05:55:20,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:20,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:20,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:20,472 INFO L87 Difference]: Start difference. First operand 10450 states and 14890 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:55:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:20,642 INFO L93 Difference]: Finished difference Result 14894 states and 21072 transitions. [2025-01-09 05:55:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:20,643 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:55:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:20,651 INFO L225 Difference]: With dead ends: 14894 [2025-01-09 05:55:20,651 INFO L226 Difference]: Without dead ends: 6012 [2025-01-09 05:55:20,658 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:55:20,660 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:55:20,660 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:55:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-01-09 05:55:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6010. [2025-01-09 05:55:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6010 states, 6008 states have (on average 1.4397470039946738) internal successors, (8650), 6009 states have internal predecessors, (8650), 0 states have call successors, (0), 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:55:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 8650 transitions. [2025-01-09 05:55:20,762 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 8650 transitions. Word has length 95 [2025-01-09 05:55:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:20,762 INFO L471 AbstractCegarLoop]: Abstraction has 6010 states and 8650 transitions. [2025-01-09 05:55:20,763 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:55:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 8650 transitions. [2025-01-09 05:55:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:55:20,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:20,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:20,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:55:20,764 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 505718284, now seen corresponding path program 1 times [2025-01-09 05:55:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:20,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920176318] [2025-01-09 05:55:20,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:20,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:55:20,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:55:20,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920176318] [2025-01-09 05:55:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920176318] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289270820] [2025-01-09 05:55:20,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:20,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:20,874 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:55:20,879 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:55:20,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:55:20,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:55:20,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:20,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:55:20,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:21,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:55:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289270820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:55:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 05:55:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776974440] [2025-01-09 05:55:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:21,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:21,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:21,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:55:21,027 INFO L87 Difference]: Start difference. First operand 6010 states and 8650 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:55:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:23,591 INFO L93 Difference]: Finished difference Result 9016 states and 13577 transitions. [2025-01-09 05:55:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:23,591 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:55:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:23,601 INFO L225 Difference]: With dead ends: 9016 [2025-01-09 05:55:23,601 INFO L226 Difference]: Without dead ends: 7512 [2025-01-09 05:55:23,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:55:23,604 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 900 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:23,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 598 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 05:55:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7512 states. [2025-01-09 05:55:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7512 to 7512. [2025-01-09 05:55:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7512 states, 7510 states have (on average 1.3941411451398136) internal successors, (10470), 7511 states have internal predecessors, (10470), 0 states have call successors, (0), 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:55:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 10470 transitions. [2025-01-09 05:55:23,719 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 10470 transitions. Word has length 95 [2025-01-09 05:55:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:23,719 INFO L471 AbstractCegarLoop]: Abstraction has 7512 states and 10470 transitions. [2025-01-09 05:55:23,719 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:55:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 10470 transitions. [2025-01-09 05:55:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:55:23,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:23,721 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:55:23,727 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:55:23,922 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,SelfDestructingSolverStorable22 [2025-01-09 05:55:23,922 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1004818921, now seen corresponding path program 1 times [2025-01-09 05:55:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445415015] [2025-01-09 05:55:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:23,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:55:23,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:55:23,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:23,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:24,054 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:55:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445415015] [2025-01-09 05:55:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445415015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:24,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:24,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231158256] [2025-01-09 05:55:24,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:24,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:24,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:24,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:24,055 INFO L87 Difference]: Start difference. First operand 7512 states and 10470 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:55:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:24,109 INFO L93 Difference]: Finished difference Result 9736 states and 13532 transitions. [2025-01-09 05:55:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:24,110 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:55:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:24,116 INFO L225 Difference]: With dead ends: 9736 [2025-01-09 05:55:24,117 INFO L226 Difference]: Without dead ends: 5294 [2025-01-09 05:55:24,120 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:55:24,121 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:55:24,121 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:55:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2025-01-09 05:55:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 5292. [2025-01-09 05:55:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5290 states have (on average 1.3950850661625709) internal successors, (7380), 5291 states have internal predecessors, (7380), 0 states have call successors, (0), 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:55:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 7380 transitions. [2025-01-09 05:55:24,189 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 7380 transitions. Word has length 97 [2025-01-09 05:55:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:24,189 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 7380 transitions. [2025-01-09 05:55:24,190 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:55:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 7380 transitions. [2025-01-09 05:55:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:55:24,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:24,191 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:55:24,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:55:24,191 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:24,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1807801147, now seen corresponding path program 1 times [2025-01-09 05:55:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103398210] [2025-01-09 05:55:24,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:24,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:55:24,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:55:24,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:24,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:24,252 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:55:24,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:24,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103398210] [2025-01-09 05:55:24,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103398210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:24,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:24,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896205891] [2025-01-09 05:55:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:24,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:24,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:24,254 INFO L87 Difference]: Start difference. First operand 5292 states and 7380 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:55:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:24,291 INFO L93 Difference]: Finished difference Result 6406 states and 8897 transitions. [2025-01-09 05:55:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:24,291 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:55:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:24,296 INFO L225 Difference]: With dead ends: 6406 [2025-01-09 05:55:24,297 INFO L226 Difference]: Without dead ends: 4184 [2025-01-09 05:55:24,298 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:55:24,299 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:55:24,299 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:55:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2025-01-09 05:55:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4182. [2025-01-09 05:55:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4180 states have (on average 1.3995215311004785) internal successors, (5850), 4181 states have internal predecessors, (5850), 0 states have call successors, (0), 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:55:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5850 transitions. [2025-01-09 05:55:24,403 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5850 transitions. Word has length 99 [2025-01-09 05:55:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:24,404 INFO L471 AbstractCegarLoop]: Abstraction has 4182 states and 5850 transitions. [2025-01-09 05:55:24,404 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:55:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5850 transitions. [2025-01-09 05:55:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:55:24,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:24,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:24,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:55:24,405 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:24,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash 977614166, now seen corresponding path program 1 times [2025-01-09 05:55:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:24,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359507013] [2025-01-09 05:55:24,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:24,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:55:24,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:55:24,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359507013] [2025-01-09 05:55:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359507013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:55:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038613255] [2025-01-09 05:55:24,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:55:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:24,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:55:24,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:24,608 INFO L87 Difference]: Start difference. First operand 4182 states and 5850 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 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:55:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:27,494 INFO L93 Difference]: Finished difference Result 7939 states and 10975 transitions. [2025-01-09 05:55:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:55:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 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:55:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:27,501 INFO L225 Difference]: With dead ends: 7939 [2025-01-09 05:55:27,501 INFO L226 Difference]: Without dead ends: 4933 [2025-01-09 05:55:27,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:55:27,504 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1822 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 3235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:27,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 1415 Invalid, 3235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 05:55:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4933 states. [2025-01-09 05:55:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4933 to 4933. [2025-01-09 05:55:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4931 states have (on average 1.3398904887446765) internal successors, (6607), 4932 states have internal predecessors, (6607), 0 states have call successors, (0), 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:55:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 6607 transitions. [2025-01-09 05:55:27,597 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 6607 transitions. Word has length 99 [2025-01-09 05:55:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:27,598 INFO L471 AbstractCegarLoop]: Abstraction has 4933 states and 6607 transitions. [2025-01-09 05:55:27,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 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:55:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 6607 transitions. [2025-01-09 05:55:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:55:27,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:27,599 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:55:27,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 05:55:27,600 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:27,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1552100595, now seen corresponding path program 1 times [2025-01-09 05:55:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:27,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594896367] [2025-01-09 05:55:27,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:27,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:55:27,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:55:27,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:27,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:28,484 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:55:28,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594896367] [2025-01-09 05:55:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594896367] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643189758] [2025-01-09 05:55:28,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:28,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:28,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:28,486 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:55:28,488 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:55:28,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:55:28,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:55:28,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:28,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:28,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:55:28,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:28,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643189758] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:29,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-01-09 05:55:29,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484833320] [2025-01-09 05:55:29,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:29,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 05:55:29,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:29,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 05:55:29,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:55:29,223 INFO L87 Difference]: Start difference. First operand 4933 states and 6607 transitions. Second operand has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 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:55:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:31,919 INFO L93 Difference]: Finished difference Result 11169 states and 14937 transitions. [2025-01-09 05:55:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-09 05:55:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 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:55:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:31,930 INFO L225 Difference]: With dead ends: 11169 [2025-01-09 05:55:31,930 INFO L226 Difference]: Without dead ends: 10057 [2025-01-09 05:55:31,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=839, Invalid=3321, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 05:55:31,934 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 16629 mSDsluCounter, 5030 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16629 SdHoareTripleChecker+Valid, 6550 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:31,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16629 Valid, 6550 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:55:31,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2025-01-09 05:55:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 9793. [2025-01-09 05:55:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9793 states, 9791 states have (on average 1.3206005515269126) internal successors, (12930), 9792 states have internal predecessors, (12930), 0 states have call successors, (0), 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:55:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9793 states to 9793 states and 12930 transitions. [2025-01-09 05:55:32,115 INFO L78 Accepts]: Start accepts. Automaton has 9793 states and 12930 transitions. Word has length 101 [2025-01-09 05:55:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:32,115 INFO L471 AbstractCegarLoop]: Abstraction has 9793 states and 12930 transitions. [2025-01-09 05:55:32,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 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:55:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 9793 states and 12930 transitions. [2025-01-09 05:55:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:55:32,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:32,117 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:55:32,134 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:55:32,318 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:55:32,318 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:32,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1049559474, now seen corresponding path program 1 times [2025-01-09 05:55:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:32,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953000605] [2025-01-09 05:55:32,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:32,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:32,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:32,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:32,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:32,775 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:55:32,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953000605] [2025-01-09 05:55:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953000605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099185682] [2025-01-09 05:55:32,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:32,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:32,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:32,778 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:55:32,780 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:55:32,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:32,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:32,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:32,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:32,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:55:32,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:33,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:34,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099185682] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:34,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:34,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-01-09 05:55:34,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161573187] [2025-01-09 05:55:34,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:34,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 05:55:34,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:34,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 05:55:34,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:55:34,487 INFO L87 Difference]: Start difference. First operand 9793 states and 12930 transitions. Second operand has 33 states, 33 states have (on average 7.757575757575758) internal successors, (256), 32 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:36,589 INFO L93 Difference]: Finished difference Result 26733 states and 35273 transitions. [2025-01-09 05:55:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 05:55:36,589 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.757575757575758) internal successors, (256), 32 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-09 05:55:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:36,617 INFO L225 Difference]: With dead ends: 26733 [2025-01-09 05:55:36,618 INFO L226 Difference]: Without dead ends: 20832 [2025-01-09 05:55:36,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=883, Invalid=3277, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 05:55:36,627 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 28308 mSDsluCounter, 8033 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28308 SdHoareTripleChecker+Valid, 9547 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:36,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28308 Valid, 9547 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:55:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20832 states. [2025-01-09 05:55:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20832 to 20768. [2025-01-09 05:55:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20768 states, 20766 states have (on average 1.3045362611961862) internal successors, (27090), 20767 states have internal predecessors, (27090), 0 states have call successors, (0), 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:55:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20768 states to 20768 states and 27090 transitions. [2025-01-09 05:55:37,058 INFO L78 Accepts]: Start accepts. Automaton has 20768 states and 27090 transitions. Word has length 102 [2025-01-09 05:55:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 20768 states and 27090 transitions. [2025-01-09 05:55:37,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.757575757575758) internal successors, (256), 32 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20768 states and 27090 transitions. [2025-01-09 05:55:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:55:37,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:37,060 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:55:37,068 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:55:37,264 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:55:37,264 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash -440309326, now seen corresponding path program 1 times [2025-01-09 05:55:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504756521] [2025-01-09 05:55:37,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:37,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:37,533 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:55:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504756521] [2025-01-09 05:55:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504756521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244278472] [2025-01-09 05:55:37,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:37,537 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:55:37,541 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:55:37,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:37,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:37,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:37,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:37,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:55:37,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:38,037 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:55:38,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:38,915 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:55:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244278472] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:38,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:55:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000580081] [2025-01-09 05:55:38,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:38,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:55:38,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:38,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:55:38,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:55:38,917 INFO L87 Difference]: Start difference. First operand 20768 states and 27090 transitions. Second operand has 25 states, 25 states have (on average 11.44) internal successors, (286), 24 states have internal predecessors, (286), 0 states have call successors, (0), 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:55:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:40,729 INFO L93 Difference]: Finished difference Result 60241 states and 78287 transitions. [2025-01-09 05:55:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 05:55:40,729 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.44) internal successors, (286), 24 states have internal predecessors, (286), 0 states have call successors, (0), 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:55:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:40,778 INFO L225 Difference]: With dead ends: 60241 [2025-01-09 05:55:40,778 INFO L226 Difference]: Without dead ends: 43971 [2025-01-09 05:55:40,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=476, Invalid=1780, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 05:55:40,802 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 19084 mSDsluCounter, 6799 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19084 SdHoareTripleChecker+Valid, 8325 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:40,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19084 Valid, 8325 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:55:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43971 states. [2025-01-09 05:55:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43971 to 24393. [2025-01-09 05:55:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24393 states, 24391 states have (on average 1.275347464228609) internal successors, (31107), 24392 states have internal predecessors, (31107), 0 states have call successors, (0), 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:55:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24393 states to 24393 states and 31107 transitions. [2025-01-09 05:55:41,568 INFO L78 Accepts]: Start accepts. Automaton has 24393 states and 31107 transitions. Word has length 102 [2025-01-09 05:55:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:41,569 INFO L471 AbstractCegarLoop]: Abstraction has 24393 states and 31107 transitions. [2025-01-09 05:55:41,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.44) internal successors, (286), 24 states have internal predecessors, (286), 0 states have call successors, (0), 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:55:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 24393 states and 31107 transitions. [2025-01-09 05:55:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:55:41,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:41,571 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] [2025-01-09 05:55:41,580 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:55:41,772 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:55:41,772 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 310552514, now seen corresponding path program 1 times [2025-01-09 05:55:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094448016] [2025-01-09 05:55:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:41,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:41,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:41,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:41,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:42,348 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:55:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094448016] [2025-01-09 05:55:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094448016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875609162] [2025-01-09 05:55:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:42,352 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:55:42,353 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:55:42,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:42,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:42,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:42,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:42,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:55:42,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:42,873 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:55:42,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:43,731 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:55:43,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875609162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:43,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:43,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:55:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934367493] [2025-01-09 05:55:43,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:55:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:43,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:55:43,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:55:43,733 INFO L87 Difference]: Start difference. First operand 24393 states and 31107 transitions. Second operand has 29 states, 29 states have (on average 8.96551724137931) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 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:55:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:46,789 INFO L93 Difference]: Finished difference Result 109967 states and 139698 transitions. [2025-01-09 05:55:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 05:55:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.96551724137931) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 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 104 [2025-01-09 05:55:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:46,897 INFO L225 Difference]: With dead ends: 109967 [2025-01-09 05:55:46,898 INFO L226 Difference]: Without dead ends: 91028 [2025-01-09 05:55:46,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=694, Invalid=2612, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 05:55:46,927 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 18786 mSDsluCounter, 6581 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18786 SdHoareTripleChecker+Valid, 8107 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:46,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18786 Valid, 8107 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:55:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91028 states. [2025-01-09 05:55:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91028 to 81746. [2025-01-09 05:55:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81746 states, 81744 states have (on average 1.262881679389313) internal successors, (103233), 81745 states have internal predecessors, (103233), 0 states have call successors, (0), 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:55:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81746 states to 81746 states and 103233 transitions. [2025-01-09 05:55:49,530 INFO L78 Accepts]: Start accepts. Automaton has 81746 states and 103233 transitions. Word has length 104 [2025-01-09 05:55:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:49,535 INFO L471 AbstractCegarLoop]: Abstraction has 81746 states and 103233 transitions. [2025-01-09 05:55:49,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.96551724137931) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 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:55:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 81746 states and 103233 transitions. [2025-01-09 05:55:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:55:49,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:49,542 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] [2025-01-09 05:55:49,552 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:55:49,742 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:55:49,743 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:49,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1984388670, now seen corresponding path program 1 times [2025-01-09 05:55:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:49,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311999258] [2025-01-09 05:55:49,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:49,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:49,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:49,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:49,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:49,968 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:55:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311999258] [2025-01-09 05:55:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311999258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820880800] [2025-01-09 05:55:49,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:49,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:49,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:49,972 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:55:49,973 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:55:50,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:50,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:50,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:50,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:50,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:55:50,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:50,438 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:55:50,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:51,153 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:55:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820880800] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:51,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:55:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834682850] [2025-01-09 05:55:51,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:51,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:55:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:51,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:55:51,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:55:51,155 INFO L87 Difference]: Start difference. First operand 81746 states and 103233 transitions. Second operand has 21 states, 21 states have (on average 10.952380952380953) internal successors, (230), 20 states have internal predecessors, (230), 0 states have call successors, (0), 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:55:55,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:55,565 INFO L93 Difference]: Finished difference Result 212624 states and 269027 transitions. [2025-01-09 05:55:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:55:55,566 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.952380952380953) internal successors, (230), 20 states have internal predecessors, (230), 0 states have call successors, (0), 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 104 [2025-01-09 05:55:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:55,758 INFO L225 Difference]: With dead ends: 212624 [2025-01-09 05:55:55,758 INFO L226 Difference]: Without dead ends: 141328 [2025-01-09 05:55:55,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:55:55,823 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 15248 mSDsluCounter, 5024 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15248 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:55,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15248 Valid, 6573 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:55:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141328 states. [2025-01-09 05:56:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141328 to 136514. [2025-01-09 05:56:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136514 states, 136512 states have (on average 1.251684833567745) internal successors, (170870), 136513 states have internal predecessors, (170870), 0 states have call successors, (0), 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:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136514 states to 136514 states and 170870 transitions. [2025-01-09 05:56:00,834 INFO L78 Accepts]: Start accepts. Automaton has 136514 states and 170870 transitions. Word has length 104 [2025-01-09 05:56:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:00,834 INFO L471 AbstractCegarLoop]: Abstraction has 136514 states and 170870 transitions. [2025-01-09 05:56:00,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.952380952380953) internal successors, (230), 20 states have internal predecessors, (230), 0 states have call successors, (0), 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:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 136514 states and 170870 transitions. [2025-01-09 05:56:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:56:00,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:00,838 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:56:00,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 05:56:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-09 05:56:01,039 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1864718673, now seen corresponding path program 1 times [2025-01-09 05:56:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502140271] [2025-01-09 05:56:01,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:01,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:01,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:01,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:01,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:01,301 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:56:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502140271] [2025-01-09 05:56:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502140271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968120974] [2025-01-09 05:56:01,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:01,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:01,304 INFO L229 MonitoredProcess]: Starting monitored process 8 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:01,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:56:01,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:01,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:01,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:01,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:01,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 05:56:01,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:03,057 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:03,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:05,304 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:56:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968120974] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:05,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:05,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 37 [2025-01-09 05:56:05,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085471717] [2025-01-09 05:56:05,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:05,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 05:56:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:05,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 05:56:05,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 05:56:05,307 INFO L87 Difference]: Start difference. First operand 136514 states and 170870 transitions. Second operand has 37 states, 37 states have (on average 7.918918918918919) internal successors, (293), 37 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)