./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-1.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/pc_sfifo_1.cil-2+token_ring.06.cil-1.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 ebe8677bb7c1f5255df364410243bb239a688bf1d1729cbbc508fc2f6afa38f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:02:12,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:02:12,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:02:12,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:02:12,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:02:12,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:02:12,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:02:12,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:02:12,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:02:12,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:02:12,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:02:12,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:02:12,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:02:12,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:02:12,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:02:12,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:02:12,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:02:12,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:02:12,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:12,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:12,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:02:12,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:02:12,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:02:12,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:02:12,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:02:12,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:02:12,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:02:12,927 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 -> ebe8677bb7c1f5255df364410243bb239a688bf1d1729cbbc508fc2f6afa38f5 [2025-01-09 06:02:13,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:02:13,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:02:13,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:02:13,164 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:02:13,165 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:02:13,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-1.c [2025-01-09 06:02:14,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7256f6c/0ef59220fec34a0c8bd8ec62956adcab/FLAG8aefd9df9 [2025-01-09 06:02:14,742 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:02:14,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-1.c [2025-01-09 06:02:14,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7256f6c/0ef59220fec34a0c8bd8ec62956adcab/FLAG8aefd9df9 [2025-01-09 06:02:14,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7256f6c/0ef59220fec34a0c8bd8ec62956adcab [2025-01-09 06:02:14,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:02:14,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:02:14,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:02:14,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:02:14,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:02:14,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:02:14" (1/1) ... [2025-01-09 06:02:14,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6baaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:14, skipping insertion in model container [2025-01-09 06:02:14,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:02:14" (1/1) ... [2025-01-09 06:02:14,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:02:14,939 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/pc_sfifo_1.cil-2+token_ring.06.cil-1.c[913,926] [2025-01-09 06:02:14,990 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/pc_sfifo_1.cil-2+token_ring.06.cil-1.c[5977,5990] [2025-01-09 06:02:15,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:02:15,070 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:02:15,081 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/pc_sfifo_1.cil-2+token_ring.06.cil-1.c[913,926] [2025-01-09 06:02:15,102 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/pc_sfifo_1.cil-2+token_ring.06.cil-1.c[5977,5990] [2025-01-09 06:02:15,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:02:15,143 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:02:15,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15 WrapperNode [2025-01-09 06:02:15,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:02:15,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:02:15,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:02:15,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:02:15,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,185 INFO L138 Inliner]: procedures = 60, calls = 67, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 690 [2025-01-09 06:02:15,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:02:15,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:02:15,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:02:15,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:02:15,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,211 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 06:02:15,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:02:15,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:02:15,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:02:15,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:02:15,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (1/1) ... [2025-01-09 06:02:15,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:15,256 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 06:02:15,261 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 06:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:02:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-01-09 06:02:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-01-09 06:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:02:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:02:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:02:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:02:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:02:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:02:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:02:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:02:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:02:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:02:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:02:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:02:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:02:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:02:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:02:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:02:15,277 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:02:15,343 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:02:15,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:02:15,813 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-01-09 06:02:15,813 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:02:15,825 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:02:15,825 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 06:02:15,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:02:15 BoogieIcfgContainer [2025-01-09 06:02:15,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:02:15,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:02:15,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:02:15,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:02:15,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:02:14" (1/3) ... [2025-01-09 06:02:15,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:02:15, skipping insertion in model container [2025-01-09 06:02:15,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:15" (2/3) ... [2025-01-09 06:02:15,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:02:15, skipping insertion in model container [2025-01-09 06:02:15,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:02:15" (3/3) ... [2025-01-09 06:02:15,832 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.06.cil-1.c [2025-01-09 06:02:15,842 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:02:15,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.06.cil-1.c that has 11 procedures, 306 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 06:02:15,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:02:15,893 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;@2b4405c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:02:15,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:02:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 267 states have (on average 1.5767790262172285) internal successors, (421), 272 states have internal predecessors, (421), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 06:02:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 06:02:15,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:15,903 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] [2025-01-09 06:02:15,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:15,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2000300414, now seen corresponding path program 1 times [2025-01-09 06:02:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:15,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078092637] [2025-01-09 06:02:15,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:15,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 06:02:15,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 06:02:15,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:15,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:16,072 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 06:02:16,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078092637] [2025-01-09 06:02:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078092637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:16,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:16,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022666622] [2025-01-09 06:02:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:16,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:16,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:16,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:16,094 INFO L87 Difference]: Start difference. First operand has 306 states, 267 states have (on average 1.5767790262172285) internal successors, (421), 272 states have internal predecessors, (421), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:02:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:16,163 INFO L93 Difference]: Finished difference Result 647 states and 1010 transitions. [2025-01-09 06:02:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:16,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-01-09 06:02:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:16,172 INFO L225 Difference]: With dead ends: 647 [2025-01-09 06:02:16,172 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 06:02:16,175 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 06:02:16,177 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 438 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:16,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 550 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 06:02:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 346. [2025-01-09 06:02:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 302 states have (on average 1.5165562913907285) internal successors, (458), 306 states have internal predecessors, (458), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (32), 28 states have call predecessors, (32), 28 states have call successors, (32) [2025-01-09 06:02:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 522 transitions. [2025-01-09 06:02:16,276 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 522 transitions. Word has length 41 [2025-01-09 06:02:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:16,277 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 522 transitions. [2025-01-09 06:02:16,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:02:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 522 transitions. [2025-01-09 06:02:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 06:02:16,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:16,279 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] [2025-01-09 06:02:16,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:02:16,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:16,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1290646285, now seen corresponding path program 1 times [2025-01-09 06:02:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966988971] [2025-01-09 06:02:16,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:16,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 06:02:16,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 06:02:16,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:16,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:16,381 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 06:02:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966988971] [2025-01-09 06:02:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966988971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923449908] [2025-01-09 06:02:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:16,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:16,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:16,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:16,385 INFO L87 Difference]: Start difference. First operand 346 states and 522 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:02:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:16,454 INFO L93 Difference]: Finished difference Result 539 states and 795 transitions. [2025-01-09 06:02:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-01-09 06:02:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:16,458 INFO L225 Difference]: With dead ends: 539 [2025-01-09 06:02:16,462 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 06:02:16,463 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 06:02:16,464 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 66 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:16,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 897 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 06:02:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2025-01-09 06:02:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.5014005602240896) internal successors, (536), 361 states have internal predecessors, (536), 35 states have call successors, (35), 15 states have call predecessors, (35), 13 states have return successors, (36), 31 states have call predecessors, (36), 31 states have call successors, (36) [2025-01-09 06:02:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 607 transitions. [2025-01-09 06:02:16,505 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 607 transitions. Word has length 42 [2025-01-09 06:02:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:16,505 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 607 transitions. [2025-01-09 06:02:16,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:02:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2025-01-09 06:02:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 06:02:16,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:16,509 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] [2025-01-09 06:02:16,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:02:16,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:16,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash -572265633, now seen corresponding path program 1 times [2025-01-09 06:02:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496652258] [2025-01-09 06:02:16,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:16,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 06:02:16,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 06:02:16,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:16,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:16,584 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 06:02:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496652258] [2025-01-09 06:02:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496652258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645847556] [2025-01-09 06:02:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:16,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:16,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:16,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:16,585 INFO L87 Difference]: Start difference. First operand 407 states and 607 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:02:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:16,642 INFO L93 Difference]: Finished difference Result 732 states and 1067 transitions. [2025-01-09 06:02:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-01-09 06:02:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:16,649 INFO L225 Difference]: With dead ends: 732 [2025-01-09 06:02:16,650 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 06:02:16,650 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 06:02:16,651 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 425 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:16,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 531 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 06:02:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 552. [2025-01-09 06:02:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 484 states have (on average 1.4586776859504131) internal successors, (706), 490 states have internal predecessors, (706), 46 states have call successors, (46), 22 states have call predecessors, (46), 20 states have return successors, (52), 40 states have call predecessors, (52), 42 states have call successors, (52) [2025-01-09 06:02:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2025-01-09 06:02:16,687 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 43 [2025-01-09 06:02:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:16,688 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2025-01-09 06:02:16,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:02:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2025-01-09 06:02:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 06:02:16,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:16,693 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] [2025-01-09 06:02:16,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:02:16,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:16,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1256655992, now seen corresponding path program 1 times [2025-01-09 06:02:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759079482] [2025-01-09 06:02:16,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:16,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 06:02:16,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 06:02:16,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:16,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 06:02:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759079482] [2025-01-09 06:02:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759079482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:16,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:16,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:16,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99633988] [2025-01-09 06:02:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:16,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:16,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:16,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:16,782 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:02:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:16,820 INFO L93 Difference]: Finished difference Result 1023 states and 1460 transitions. [2025-01-09 06:02:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-01-09 06:02:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:16,825 INFO L225 Difference]: With dead ends: 1023 [2025-01-09 06:02:16,825 INFO L226 Difference]: Without dead ends: 710 [2025-01-09 06:02:16,826 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 06:02:16,827 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 53 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:16,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 941 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-01-09 06:02:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-01-09 06:02:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 620 states have (on average 1.4064516129032258) internal successors, (872), 626 states have internal predecessors, (872), 60 states have call successors, (60), 30 states have call predecessors, (60), 28 states have return successors, (74), 54 states have call predecessors, (74), 56 states have call successors, (74) [2025-01-09 06:02:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1006 transitions. [2025-01-09 06:02:16,858 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1006 transitions. Word has length 58 [2025-01-09 06:02:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:16,859 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1006 transitions. [2025-01-09 06:02:16,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:02:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1006 transitions. [2025-01-09 06:02:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:02:16,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:16,863 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] [2025-01-09 06:02:16,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:02:16,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:16,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1153458500, now seen corresponding path program 1 times [2025-01-09 06:02:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:16,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074125640] [2025-01-09 06:02:16,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:16,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:16,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:16,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:16,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:02:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074125640] [2025-01-09 06:02:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074125640] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590923213] [2025-01-09 06:02:17,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:17,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:17,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:17,067 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 06:02:17,068 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 06:02:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:17,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:17,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:17,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:17,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:02:17,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 06:02:17,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:02:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590923213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:02:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 06:02:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713304618] [2025-01-09 06:02:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:02:17,221 INFO L87 Difference]: Start difference. First operand 710 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 06:02:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:17,258 INFO L93 Difference]: Finished difference Result 1212 states and 1683 transitions. [2025-01-09 06:02:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-01-09 06:02:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:17,262 INFO L225 Difference]: With dead ends: 1212 [2025-01-09 06:02:17,263 INFO L226 Difference]: Without dead ends: 829 [2025-01-09 06:02:17,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:02:17,264 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 404 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:17,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 525 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-01-09 06:02:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2025-01-09 06:02:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 725 states have (on average 1.3779310344827587) internal successors, (999), 731 states have internal predecessors, (999), 68 states have call successors, (68), 36 states have call predecessors, (68), 34 states have return successors, (86), 62 states have call predecessors, (86), 64 states have call successors, (86) [2025-01-09 06:02:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1153 transitions. [2025-01-09 06:02:17,297 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1153 transitions. Word has length 63 [2025-01-09 06:02:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:17,297 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1153 transitions. [2025-01-09 06:02:17,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 06:02:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1153 transitions. [2025-01-09 06:02:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:02:17,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:17,299 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] [2025-01-09 06:02:17,308 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 06:02:17,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:17,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:17,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1553449699, now seen corresponding path program 1 times [2025-01-09 06:02:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199505528] [2025-01-09 06:02:17,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:17,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:17,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:17,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:02:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:17,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199505528] [2025-01-09 06:02:17,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199505528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:17,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62350542] [2025-01-09 06:02:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:17,594 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 06:02:17,595 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 06:02:17,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:17,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:17,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:17,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:17,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 06:02:17,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:02:17,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:02:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:02:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62350542] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:17,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 06:02:17,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-01-09 06:02:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276229625] [2025-01-09 06:02:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:17,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:02:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:17,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:02:17,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:02:17,836 INFO L87 Difference]: Start difference. First operand 829 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:02:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:18,062 INFO L93 Difference]: Finished difference Result 879 states and 1215 transitions. [2025-01-09 06:02:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:18,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-01-09 06:02:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:18,071 INFO L225 Difference]: With dead ends: 879 [2025-01-09 06:02:18,071 INFO L226 Difference]: Without dead ends: 876 [2025-01-09 06:02:18,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:02:18,072 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 801 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:18,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 533 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-01-09 06:02:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 828. [2025-01-09 06:02:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 725 states have (on average 1.3751724137931034) internal successors, (997), 730 states have internal predecessors, (997), 67 states have call successors, (67), 36 states have call predecessors, (67), 34 states have return successors, (86), 62 states have call predecessors, (86), 64 states have call successors, (86) [2025-01-09 06:02:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1150 transitions. [2025-01-09 06:02:18,117 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1150 transitions. Word has length 63 [2025-01-09 06:02:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:18,118 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1150 transitions. [2025-01-09 06:02:18,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:02:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1150 transitions. [2025-01-09 06:02:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:02:18,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:18,120 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] [2025-01-09 06:02:18,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 06:02:18,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:18,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:18,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash 911364847, now seen corresponding path program 1 times [2025-01-09 06:02:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:18,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737901968] [2025-01-09 06:02:18,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:18,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:18,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:02:18,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:02:18,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:18,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:02:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737901968] [2025-01-09 06:02:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737901968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300438637] [2025-01-09 06:02:18,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:18,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:18,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:18,400 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 06:02:18,405 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 06:02:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:02:18,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:02:18,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:18,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:18,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:02:18,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:02:18,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:02:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:02:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300438637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:02:18,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:02:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-01-09 06:02:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588793930] [2025-01-09 06:02:18,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:02:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:02:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:18,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:02:18,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:02:18,791 INFO L87 Difference]: Start difference. First operand 828 states and 1150 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 06:02:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:19,150 INFO L93 Difference]: Finished difference Result 2065 states and 2827 transitions. [2025-01-09 06:02:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 06:02:19,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 64 [2025-01-09 06:02:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:19,157 INFO L225 Difference]: With dead ends: 2065 [2025-01-09 06:02:19,157 INFO L226 Difference]: Without dead ends: 1608 [2025-01-09 06:02:19,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-01-09 06:02:19,159 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 582 mSDsluCounter, 3153 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:19,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 3684 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2025-01-09 06:02:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1163. [2025-01-09 06:02:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1024 states have (on average 1.33984375) internal successors, (1372), 1034 states have internal predecessors, (1372), 87 states have call successors, (87), 50 states have call predecessors, (87), 50 states have return successors, (117), 79 states have call predecessors, (117), 84 states have call successors, (117) [2025-01-09 06:02:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1576 transitions. [2025-01-09 06:02:19,213 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1576 transitions. Word has length 64 [2025-01-09 06:02:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:19,213 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1576 transitions. [2025-01-09 06:02:19,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 06:02:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1576 transitions. [2025-01-09 06:02:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 06:02:19,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:19,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 06:02:19,224 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 06:02:19,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:19,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:19,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2032250428, now seen corresponding path program 1 times [2025-01-09 06:02:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762494557] [2025-01-09 06:02:19,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:19,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 06:02:19,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 06:02:19,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:19,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 06:02:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762494557] [2025-01-09 06:02:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762494557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:19,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471829612] [2025-01-09 06:02:19,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:19,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:19,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:19,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:19,454 INFO L87 Difference]: Start difference. First operand 1163 states and 1576 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 06:02:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:19,531 INFO L93 Difference]: Finished difference Result 1763 states and 2371 transitions. [2025-01-09 06:02:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-01-09 06:02:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:19,539 INFO L225 Difference]: With dead ends: 1763 [2025-01-09 06:02:19,539 INFO L226 Difference]: Without dead ends: 1051 [2025-01-09 06:02:19,541 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 06:02:19,541 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 423 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:19,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 547 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-01-09 06:02:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1042. [2025-01-09 06:02:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 917 states have (on average 1.3391494002181026) internal successors, (1228), 928 states have internal predecessors, (1228), 79 states have call successors, (79), 44 states have call predecessors, (79), 44 states have return successors, (105), 70 states have call predecessors, (105), 76 states have call successors, (105) [2025-01-09 06:02:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1412 transitions. [2025-01-09 06:02:19,583 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1412 transitions. Word has length 82 [2025-01-09 06:02:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:19,583 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1412 transitions. [2025-01-09 06:02:19,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 06:02:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1412 transitions. [2025-01-09 06:02:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 06:02:19,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:19,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 06:02:19,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:02:19,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:19,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash 724455673, now seen corresponding path program 1 times [2025-01-09 06:02:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309879126] [2025-01-09 06:02:19,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:19,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 06:02:19,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 06:02:19,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:19,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 06:02:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309879126] [2025-01-09 06:02:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309879126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451523736] [2025-01-09 06:02:19,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:19,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:19,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:19,645 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 06:02:19,648 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 06:02:19,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 06:02:19,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 06:02:19,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:19,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:19,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:02:19,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 06:02:19,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:02:19,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451523736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:19,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:02:19,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 06:02:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541263399] [2025-01-09 06:02:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:19,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:19,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:19,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:02:19,750 INFO L87 Difference]: Start difference. First operand 1042 states and 1412 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 06:02:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:19,794 INFO L93 Difference]: Finished difference Result 1391 states and 1853 transitions. [2025-01-09 06:02:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:19,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 96 [2025-01-09 06:02:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:19,797 INFO L225 Difference]: With dead ends: 1391 [2025-01-09 06:02:19,797 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 06:02:19,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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 06:02:19,799 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 60 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:19,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 913 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 06:02:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-01-09 06:02:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.5588235294117647) internal successors, (318), 206 states have internal predecessors, (318), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 06:02:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 360 transitions. [2025-01-09 06:02:19,807 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 360 transitions. Word has length 96 [2025-01-09 06:02:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:19,808 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 360 transitions. [2025-01-09 06:02:19,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 06:02:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 360 transitions. [2025-01-09 06:02:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:19,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:19,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:19,819 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 06:02:20,009 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,SelfDestructingSolverStorable8 [2025-01-09 06:02:20,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 414986093, now seen corresponding path program 1 times [2025-01-09 06:02:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514234313] [2025-01-09 06:02:20,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:20,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:20,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:20,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:20,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:20,110 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 06:02:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514234313] [2025-01-09 06:02:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514234313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:20,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:02:20,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341166187] [2025-01-09 06:02:20,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:02:20,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:20,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:02:20,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:02:20,112 INFO L87 Difference]: Start difference. First operand 233 states and 360 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:20,338 INFO L93 Difference]: Finished difference Result 466 states and 727 transitions. [2025-01-09 06:02:20,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:20,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:20,340 INFO L225 Difference]: With dead ends: 466 [2025-01-09 06:02:20,341 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 06:02:20,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:20,342 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 471 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:20,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 713 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 06:02:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2025-01-09 06:02:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.553921568627451) internal successors, (317), 206 states have internal predecessors, (317), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 06:02:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 359 transitions. [2025-01-09 06:02:20,353 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 359 transitions. Word has length 111 [2025-01-09 06:02:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:20,353 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 359 transitions. [2025-01-09 06:02:20,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 359 transitions. [2025-01-09 06:02:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:20,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:20,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:20,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:02:20,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:20,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1203988821, now seen corresponding path program 1 times [2025-01-09 06:02:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239146984] [2025-01-09 06:02:20,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:20,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:20,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:20,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:20,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:20,426 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 06:02:20,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:20,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239146984] [2025-01-09 06:02:20,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239146984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:20,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:20,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:02:20,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442659998] [2025-01-09 06:02:20,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:20,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:02:20,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:20,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:02:20,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:02:20,428 INFO L87 Difference]: Start difference. First operand 233 states and 359 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:20,637 INFO L93 Difference]: Finished difference Result 451 states and 698 transitions. [2025-01-09 06:02:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:20,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:20,639 INFO L225 Difference]: With dead ends: 451 [2025-01-09 06:02:20,639 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 06:02:20,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:20,640 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 467 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:20,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 627 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 06:02:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-01-09 06:02:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.5392156862745099) internal successors, (314), 206 states have internal predecessors, (314), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 06:02:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 356 transitions. [2025-01-09 06:02:20,659 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 356 transitions. Word has length 111 [2025-01-09 06:02:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:20,659 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 356 transitions. [2025-01-09 06:02:20,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 356 transitions. [2025-01-09 06:02:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:20,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:20,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:20,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:02:20,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1385897937, now seen corresponding path program 1 times [2025-01-09 06:02:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:20,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034616150] [2025-01-09 06:02:20,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:20,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:20,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:20,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:20,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:20,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:20,754 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 06:02:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:20,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034616150] [2025-01-09 06:02:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034616150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:20,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:02:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166663907] [2025-01-09 06:02:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:20,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:02:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:20,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:02:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:02:20,756 INFO L87 Difference]: Start difference. First operand 233 states and 356 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:20,960 INFO L93 Difference]: Finished difference Result 464 states and 715 transitions. [2025-01-09 06:02:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:20,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:20,965 INFO L225 Difference]: With dead ends: 464 [2025-01-09 06:02:20,965 INFO L226 Difference]: Without dead ends: 246 [2025-01-09 06:02:20,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:20,966 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 463 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:20,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 693 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-09 06:02:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 233. [2025-01-09 06:02:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.5343137254901962) internal successors, (313), 206 states have internal predecessors, (313), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 06:02:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 355 transitions. [2025-01-09 06:02:20,976 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 355 transitions. Word has length 111 [2025-01-09 06:02:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:20,976 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 355 transitions. [2025-01-09 06:02:20,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 355 transitions. [2025-01-09 06:02:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:20,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:20,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:20,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:02:20,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1414398227, now seen corresponding path program 1 times [2025-01-09 06:02:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518000698] [2025-01-09 06:02:20,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:20,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:20,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:20,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:20,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:21,057 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 06:02:21,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:21,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518000698] [2025-01-09 06:02:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518000698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:21,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:21,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:02:21,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778285187] [2025-01-09 06:02:21,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:21,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:02:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:21,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:02:21,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:02:21,058 INFO L87 Difference]: Start difference. First operand 233 states and 355 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:21,281 INFO L93 Difference]: Finished difference Result 463 states and 711 transitions. [2025-01-09 06:02:21,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:21,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:21,283 INFO L225 Difference]: With dead ends: 463 [2025-01-09 06:02:21,283 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 06:02:21,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:21,284 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 460 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:21,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 685 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 06:02:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 233. [2025-01-09 06:02:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.5294117647058822) internal successors, (312), 206 states have internal predecessors, (312), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 06:02:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 354 transitions. [2025-01-09 06:02:21,303 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 354 transitions. Word has length 111 [2025-01-09 06:02:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:21,303 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 354 transitions. [2025-01-09 06:02:21,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 354 transitions. [2025-01-09 06:02:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:21,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:21,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:21,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:02:21,304 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:21,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash 939987055, now seen corresponding path program 1 times [2025-01-09 06:02:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:21,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330892927] [2025-01-09 06:02:21,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:21,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:21,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:21,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:21,422 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 06:02:21,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330892927] [2025-01-09 06:02:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330892927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:21,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:02:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087291857] [2025-01-09 06:02:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:02:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:21,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:02:21,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:21,423 INFO L87 Difference]: Start difference. First operand 233 states and 354 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:21,863 INFO L93 Difference]: Finished difference Result 687 states and 1050 transitions. [2025-01-09 06:02:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:02:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:21,867 INFO L225 Difference]: With dead ends: 687 [2025-01-09 06:02:21,867 INFO L226 Difference]: Without dead ends: 469 [2025-01-09 06:02:21,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:02:21,868 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 627 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:21,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1797 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:02:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-01-09 06:02:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 455. [2025-01-09 06:02:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 403 states have (on average 1.5359801488833746) internal successors, (619), 406 states have internal predecessors, (619), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (39), 37 states have call predecessors, (39), 36 states have call successors, (39) [2025-01-09 06:02:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 696 transitions. [2025-01-09 06:02:21,903 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 696 transitions. Word has length 111 [2025-01-09 06:02:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:21,903 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 696 transitions. [2025-01-09 06:02:21,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 696 transitions. [2025-01-09 06:02:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:21,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:21,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:02:21,904 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:21,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash 169253489, now seen corresponding path program 1 times [2025-01-09 06:02:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818013623] [2025-01-09 06:02:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:21,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:21,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:21,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:21,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:22,007 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 06:02:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818013623] [2025-01-09 06:02:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818013623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:22,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:02:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688275998] [2025-01-09 06:02:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:22,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:02:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:22,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:02:22,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:22,009 INFO L87 Difference]: Start difference. First operand 455 states and 696 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:22,413 INFO L93 Difference]: Finished difference Result 1378 states and 2125 transitions. [2025-01-09 06:02:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:02:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:22,418 INFO L225 Difference]: With dead ends: 1378 [2025-01-09 06:02:22,418 INFO L226 Difference]: Without dead ends: 938 [2025-01-09 06:02:22,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:02:22,421 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 643 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:22,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1165 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:02:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-09 06:02:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 916. [2025-01-09 06:02:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 816 states have (on average 1.5441176470588236) internal successors, (1260), 823 states have internal predecessors, (1260), 70 states have call successors, (70), 25 states have call predecessors, (70), 29 states have return successors, (83), 71 states have call predecessors, (83), 68 states have call successors, (83) [2025-01-09 06:02:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1413 transitions. [2025-01-09 06:02:22,481 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1413 transitions. Word has length 111 [2025-01-09 06:02:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:22,481 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1413 transitions. [2025-01-09 06:02:22,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1413 transitions. [2025-01-09 06:02:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:22,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:22,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:22,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:02:22,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:22,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash -825440209, now seen corresponding path program 1 times [2025-01-09 06:02:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:22,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454761770] [2025-01-09 06:02:22,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:22,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:22,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:22,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:22,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:22,587 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 06:02:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:22,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454761770] [2025-01-09 06:02:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454761770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:22,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:22,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:02:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026957247] [2025-01-09 06:02:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:02:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:22,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:02:22,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:22,589 INFO L87 Difference]: Start difference. First operand 916 states and 1413 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:23,148 INFO L93 Difference]: Finished difference Result 3008 states and 4687 transitions. [2025-01-09 06:02:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:02:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:23,156 INFO L225 Difference]: With dead ends: 3008 [2025-01-09 06:02:23,156 INFO L226 Difference]: Without dead ends: 2107 [2025-01-09 06:02:23,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:02:23,159 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 811 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:23,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1748 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:02:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2025-01-09 06:02:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1871. [2025-01-09 06:02:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1673 states have (on average 1.5564853556485356) internal successors, (2604), 1694 states have internal predecessors, (2604), 130 states have call successors, (130), 49 states have call predecessors, (130), 67 states have return successors, (191), 135 states have call predecessors, (191), 128 states have call successors, (191) [2025-01-09 06:02:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2925 transitions. [2025-01-09 06:02:23,260 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2925 transitions. Word has length 111 [2025-01-09 06:02:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2925 transitions. [2025-01-09 06:02:23,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2925 transitions. [2025-01-09 06:02:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:23,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:23,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:23,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:02:23,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:23,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1411716431, now seen corresponding path program 1 times [2025-01-09 06:02:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:23,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063281616] [2025-01-09 06:02:23,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:23,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:23,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:23,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:23,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:23,361 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 06:02:23,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063281616] [2025-01-09 06:02:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063281616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:23,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:23,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:02:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228435843] [2025-01-09 06:02:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:02:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:23,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:02:23,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:23,363 INFO L87 Difference]: Start difference. First operand 1871 states and 2925 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:24,008 INFO L93 Difference]: Finished difference Result 6138 states and 9739 transitions. [2025-01-09 06:02:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:02:24,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:24,028 INFO L225 Difference]: With dead ends: 6138 [2025-01-09 06:02:24,028 INFO L226 Difference]: Without dead ends: 4282 [2025-01-09 06:02:24,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:02:24,036 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 664 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:24,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1728 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:02:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2025-01-09 06:02:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3814. [2025-01-09 06:02:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3406 states have (on average 1.5631238990017615) internal successors, (5324), 3473 states have internal predecessors, (5324), 246 states have call successors, (246), 97 states have call predecessors, (246), 161 states have return successors, (499), 259 states have call predecessors, (499), 244 states have call successors, (499) [2025-01-09 06:02:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 6069 transitions. [2025-01-09 06:02:24,238 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 6069 transitions. Word has length 111 [2025-01-09 06:02:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:24,238 INFO L471 AbstractCegarLoop]: Abstraction has 3814 states and 6069 transitions. [2025-01-09 06:02:24,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 6069 transitions. [2025-01-09 06:02:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:24,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:24,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:02:24,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:24,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash 924676079, now seen corresponding path program 1 times [2025-01-09 06:02:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208160236] [2025-01-09 06:02:24,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:24,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:24,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:24,352 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 06:02:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:24,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208160236] [2025-01-09 06:02:24,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208160236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:24,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:02:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395690482] [2025-01-09 06:02:24,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:24,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:02:24,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:24,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:02:24,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:24,354 INFO L87 Difference]: Start difference. First operand 3814 states and 6069 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:25,197 INFO L93 Difference]: Finished difference Result 12520 states and 20391 transitions. [2025-01-09 06:02:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:02:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:25,246 INFO L225 Difference]: With dead ends: 12520 [2025-01-09 06:02:25,246 INFO L226 Difference]: Without dead ends: 8721 [2025-01-09 06:02:25,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:02:25,261 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 741 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:25,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1716 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:02:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2025-01-09 06:02:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 8045. [2025-01-09 06:02:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8045 states, 7171 states have (on average 1.5769069864732952) internal successors, (11308), 7384 states have internal predecessors, (11308), 470 states have call successors, (470), 193 states have call predecessors, (470), 403 states have return successors, (1491), 499 states have call predecessors, (1491), 468 states have call successors, (1491) [2025-01-09 06:02:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8045 states to 8045 states and 13269 transitions. [2025-01-09 06:02:25,785 INFO L78 Accepts]: Start accepts. Automaton has 8045 states and 13269 transitions. Word has length 111 [2025-01-09 06:02:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:25,785 INFO L471 AbstractCegarLoop]: Abstraction has 8045 states and 13269 transitions. [2025-01-09 06:02:25,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 8045 states and 13269 transitions. [2025-01-09 06:02:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:25,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:25,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:25,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:02:25,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:25,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1493808399, now seen corresponding path program 1 times [2025-01-09 06:02:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683280643] [2025-01-09 06:02:25,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:25,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:25,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:25,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:25,875 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 06:02:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683280643] [2025-01-09 06:02:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683280643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:02:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606093502] [2025-01-09 06:02:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:02:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:25,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:02:25,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:02:25,878 INFO L87 Difference]: Start difference. First operand 8045 states and 13269 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:26,604 INFO L93 Difference]: Finished difference Result 17290 states and 29304 transitions. [2025-01-09 06:02:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:26,654 INFO L225 Difference]: With dead ends: 17290 [2025-01-09 06:02:26,655 INFO L226 Difference]: Without dead ends: 9260 [2025-01-09 06:02:26,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:26,681 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 449 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:26,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 639 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2025-01-09 06:02:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 8045. [2025-01-09 06:02:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8045 states, 7171 states have (on average 1.572444568400502) internal successors, (11276), 7384 states have internal predecessors, (11276), 470 states have call successors, (470), 193 states have call predecessors, (470), 403 states have return successors, (1491), 499 states have call predecessors, (1491), 468 states have call successors, (1491) [2025-01-09 06:02:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8045 states to 8045 states and 13237 transitions. [2025-01-09 06:02:27,511 INFO L78 Accepts]: Start accepts. Automaton has 8045 states and 13237 transitions. Word has length 111 [2025-01-09 06:02:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:27,515 INFO L471 AbstractCegarLoop]: Abstraction has 8045 states and 13237 transitions. [2025-01-09 06:02:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8045 states and 13237 transitions. [2025-01-09 06:02:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:27,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:27,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:27,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:02:27,524 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:27,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash 922027951, now seen corresponding path program 1 times [2025-01-09 06:02:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510147299] [2025-01-09 06:02:27,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:27,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:27,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:27,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:27,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:27,704 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 06:02:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510147299] [2025-01-09 06:02:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510147299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:02:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698038602] [2025-01-09 06:02:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:27,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:02:27,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:27,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:02:27,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:27,711 INFO L87 Difference]: Start difference. First operand 8045 states and 13237 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:29,774 INFO L93 Difference]: Finished difference Result 25811 states and 44125 transitions. [2025-01-09 06:02:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:02:29,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:29,864 INFO L225 Difference]: With dead ends: 25811 [2025-01-09 06:02:29,864 INFO L226 Difference]: Without dead ends: 17781 [2025-01-09 06:02:29,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:02:29,892 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 668 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:29,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1679 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:02:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17781 states. [2025-01-09 06:02:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17781 to 16945. [2025-01-09 06:02:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16945 states, 14993 states have (on average 1.5774027879677184) internal successors, (23650), 15660 states have internal predecessors, (23650), 902 states have call successors, (902), 385 states have call predecessors, (902), 1049 states have return successors, (4995), 963 states have call predecessors, (4995), 900 states have call successors, (4995) [2025-01-09 06:02:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 29547 transitions. [2025-01-09 06:02:31,203 INFO L78 Accepts]: Start accepts. Automaton has 16945 states and 29547 transitions. Word has length 111 [2025-01-09 06:02:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:31,204 INFO L471 AbstractCegarLoop]: Abstraction has 16945 states and 29547 transitions. [2025-01-09 06:02:31,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16945 states and 29547 transitions. [2025-01-09 06:02:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:31,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:31,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:02:31,216 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2048083151, now seen corresponding path program 1 times [2025-01-09 06:02:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:31,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504453505] [2025-01-09 06:02:31,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:31,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:31,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:31,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:31,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:31,331 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 06:02:31,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:31,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504453505] [2025-01-09 06:02:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504453505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:31,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:02:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800603466] [2025-01-09 06:02:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:31,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:02:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:31,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:02:31,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:02:31,359 INFO L87 Difference]: Start difference. First operand 16945 states and 29547 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:32,709 INFO L93 Difference]: Finished difference Result 35333 states and 64024 transitions. [2025-01-09 06:02:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:32,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:32,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:32,787 INFO L225 Difference]: With dead ends: 35333 [2025-01-09 06:02:32,787 INFO L226 Difference]: Without dead ends: 18403 [2025-01-09 06:02:32,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:32,825 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 444 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:32,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 619 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18403 states. [2025-01-09 06:02:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18403 to 16945. [2025-01-09 06:02:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16945 states, 14993 states have (on average 1.5731341292603216) internal successors, (23586), 15660 states have internal predecessors, (23586), 902 states have call successors, (902), 385 states have call predecessors, (902), 1049 states have return successors, (4995), 963 states have call predecessors, (4995), 900 states have call successors, (4995) [2025-01-09 06:02:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 29483 transitions. [2025-01-09 06:02:33,912 INFO L78 Accepts]: Start accepts. Automaton has 16945 states and 29483 transitions. Word has length 111 [2025-01-09 06:02:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:33,912 INFO L471 AbstractCegarLoop]: Abstraction has 16945 states and 29483 transitions. [2025-01-09 06:02:33,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 16945 states and 29483 transitions. [2025-01-09 06:02:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:02:33,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:33,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:33,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:02:33,922 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1189046067, now seen corresponding path program 1 times [2025-01-09 06:02:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838021343] [2025-01-09 06:02:33,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:33,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:02:33,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:02:33,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:33,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:33,971 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 06:02:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838021343] [2025-01-09 06:02:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838021343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:33,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:33,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:02:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554610575] [2025-01-09 06:02:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:33,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:02:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:33,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:02:33,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:02:33,974 INFO L87 Difference]: Start difference. First operand 16945 states and 29483 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:35,701 INFO L93 Difference]: Finished difference Result 42910 states and 75203 transitions. [2025-01-09 06:02:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:35,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-01-09 06:02:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:35,823 INFO L225 Difference]: With dead ends: 42910 [2025-01-09 06:02:35,823 INFO L226 Difference]: Without dead ends: 25981 [2025-01-09 06:02:35,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:02:35,882 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 592 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:35,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1215 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:02:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25981 states. [2025-01-09 06:02:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25981 to 24545. [2025-01-09 06:02:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24545 states, 21726 states have (on average 1.5565221393721809) internal successors, (33817), 22636 states have internal predecessors, (33817), 1366 states have call successors, (1366), 577 states have call predecessors, (1366), 1452 states have return successors, (6451), 1395 states have call predecessors, (6451), 1364 states have call successors, (6451) [2025-01-09 06:02:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24545 states to 24545 states and 41634 transitions. [2025-01-09 06:02:37,361 INFO L78 Accepts]: Start accepts. Automaton has 24545 states and 41634 transitions. Word has length 111 [2025-01-09 06:02:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:37,361 INFO L471 AbstractCegarLoop]: Abstraction has 24545 states and 41634 transitions. [2025-01-09 06:02:37,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:02:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 24545 states and 41634 transitions. [2025-01-09 06:02:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 06:02:37,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:37,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 06:02:37,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:02:37,398 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:37,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1492727357, now seen corresponding path program 1 times [2025-01-09 06:02:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:37,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082964781] [2025-01-09 06:02:37,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:37,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:37,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 06:02:37,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 06:02:37,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:37,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 06:02:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:37,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082964781] [2025-01-09 06:02:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082964781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:37,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672996627] [2025-01-09 06:02:37,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:37,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:37,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:37,476 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 06:02:37,477 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 06:02:37,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 06:02:37,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 06:02:37,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:37,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:37,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:02:37,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 06:02:37,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:02:37,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672996627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:37,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:02:37,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 06:02:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687934282] [2025-01-09 06:02:37,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:37,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:37,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:37,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:37,653 INFO L87 Difference]: Start difference. First operand 24545 states and 41634 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:02:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:40,747 INFO L93 Difference]: Finished difference Result 73122 states and 124802 transitions. [2025-01-09 06:02:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 180 [2025-01-09 06:02:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:40,953 INFO L225 Difference]: With dead ends: 73122 [2025-01-09 06:02:40,954 INFO L226 Difference]: Without dead ends: 48593 [2025-01-09 06:02:41,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:41,027 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 294 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:41,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 663 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48593 states. [2025-01-09 06:02:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48593 to 48493. [2025-01-09 06:02:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48493 states, 42958 states have (on average 1.5560547511522882) internal successors, (66845), 44776 states have internal predecessors, (66845), 2630 states have call successors, (2630), 1153 states have call predecessors, (2630), 2904 states have return successors, (12739), 2627 states have call predecessors, (12739), 2628 states have call successors, (12739) [2025-01-09 06:02:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48493 states to 48493 states and 82214 transitions. [2025-01-09 06:02:44,238 INFO L78 Accepts]: Start accepts. Automaton has 48493 states and 82214 transitions. Word has length 180 [2025-01-09 06:02:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:44,239 INFO L471 AbstractCegarLoop]: Abstraction has 48493 states and 82214 transitions. [2025-01-09 06:02:44,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:02:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 48493 states and 82214 transitions. [2025-01-09 06:02:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 06:02:44,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:44,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 06:02:44,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 06:02:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 06:02:44,506 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash -423381697, now seen corresponding path program 1 times [2025-01-09 06:02:44,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:44,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812382878] [2025-01-09 06:02:44,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:44,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 06:02:44,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 06:02:44,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:44,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 06:02:44,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:44,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812382878] [2025-01-09 06:02:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812382878] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077853306] [2025-01-09 06:02:44,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:44,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:44,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:44,580 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 06:02:44,588 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 06:02:44,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 06:02:44,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 06:02:44,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:44,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:44,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:02:44,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 06:02:44,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:02:44,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077853306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:44,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:02:44,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 06:02:44,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972165805] [2025-01-09 06:02:44,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:44,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:44,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:44,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:44,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:44,776 INFO L87 Difference]: Start difference. First operand 48493 states and 82214 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:02:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:48,930 INFO L93 Difference]: Finished difference Result 144486 states and 246462 transitions. [2025-01-09 06:02:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 180 [2025-01-09 06:02:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:49,462 INFO L225 Difference]: With dead ends: 144486 [2025-01-09 06:02:49,462 INFO L226 Difference]: Without dead ends: 96009 [2025-01-09 06:02:49,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:49,566 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 276 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:49,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 663 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96009 states.