./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:33:10,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:33:10,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:33:10,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:33:10,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:33:10,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:33:10,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:33:10,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:33:10,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:33:10,870 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:33:10,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:33:10,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:33:10,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:33:10,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:33:10,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:33:10,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:10,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:33:10,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:33:10,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:33:10,873 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/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 -> 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 [2025-03-08 07:33:11,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:33:11,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:33:11,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:33:11,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:33:11,130 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:33:11,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-03-08 07:33:12,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c3becf9/ff6fa47beaed425bbc45777cbd869333/FLAG3c763b647 [2025-03-08 07:33:12,594 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:33:12,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-03-08 07:33:12,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c3becf9/ff6fa47beaed425bbc45777cbd869333/FLAG3c763b647 [2025-03-08 07:33:12,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c3becf9/ff6fa47beaed425bbc45777cbd869333 [2025-03-08 07:33:12,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:33:12,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:33:12,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:12,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:33:12,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:33:12,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:12" (1/1) ... [2025-03-08 07:33:12,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc86115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:12, skipping insertion in model container [2025-03-08 07:33:12,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:12" (1/1) ... [2025-03-08 07:33:12,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:33:13,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2025-03-08 07:33:13,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2025-03-08 07:33:13,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:13,102 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:33:13,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2025-03-08 07:33:13,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2025-03-08 07:33:13,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:13,175 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:33:13,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13 WrapperNode [2025-03-08 07:33:13,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:13,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:13,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:33:13,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:33:13,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,208 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 675 [2025-03-08 07:33:13,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:13,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:33:13,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:33:13,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:33:13,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,225 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-03-08 07:33:13,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:33:13,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:33:13,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:33:13,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:33:13,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (1/1) ... [2025-03-08 07:33:13,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:13,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:13,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:33:13,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:33:13,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:33:13,286 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:33:13,286 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:33:13,286 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:33:13,286 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:33:13,286 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:33:13,286 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:33:13,286 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:33:13,286 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:33:13,286 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:33:13,286 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:33:13,287 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:33:13,287 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:33:13,287 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:33:13,287 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:33:13,287 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:33:13,287 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:33:13,287 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:33:13,287 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:33:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:33:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:33:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:33:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:33:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:33:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:33:13,288 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:33:13,288 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:33:13,369 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:33:13,371 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:33:14,064 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-03-08 07:33:14,065 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:33:14,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:33:14,084 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:33:14,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:14 BoogieIcfgContainer [2025-03-08 07:33:14,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:33:14,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:33:14,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:33:14,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:33:14,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:33:12" (1/3) ... [2025-03-08 07:33:14,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a19193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:14, skipping insertion in model container [2025-03-08 07:33:14,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:13" (2/3) ... [2025-03-08 07:33:14,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a19193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:14, skipping insertion in model container [2025-03-08 07:33:14,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:14" (3/3) ... [2025-03-08 07:33:14,092 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2025-03-08 07:33:14,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:33:14,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c that has 16 procedures, 335 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-08 07:33:14,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:33:14,166 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;@199373e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:33:14,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:33:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 283 states have (on average 1.568904593639576) internal successors, (444), 289 states have internal predecessors, (444), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 07:33:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:14,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:14,181 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] [2025-03-08 07:33:14,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:14,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1170955446, now seen corresponding path program 1 times [2025-03-08 07:33:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843790729] [2025-03-08 07:33:14,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:14,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:14,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:14,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:14,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:14,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843790729] [2025-03-08 07:33:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843790729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:14,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920584084] [2025-03-08 07:33:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:14,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:14,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:14,579 INFO L87 Difference]: Start difference. First operand has 335 states, 283 states have (on average 1.568904593639576) internal successors, (444), 289 states have internal predecessors, (444), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:15,254 INFO L93 Difference]: Finished difference Result 746 states and 1148 transitions. [2025-03-08 07:33:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:15,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:15,269 INFO L225 Difference]: With dead ends: 746 [2025-03-08 07:33:15,269 INFO L226 Difference]: Without dead ends: 423 [2025-03-08 07:33:15,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-03-08 07:33:15,274 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 357 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:15,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1078 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-08 07:33:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2025-03-08 07:33:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 345 states have (on average 1.5072463768115942) internal successors, (520), 352 states have internal predecessors, (520), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2025-03-08 07:33:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 615 transitions. [2025-03-08 07:33:15,334 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 615 transitions. Word has length 62 [2025-03-08 07:33:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:15,334 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 615 transitions. [2025-03-08 07:33:15,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 615 transitions. [2025-03-08 07:33:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:15,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:15,337 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] [2025-03-08 07:33:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:33:15,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1438713191, now seen corresponding path program 1 times [2025-03-08 07:33:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843111737] [2025-03-08 07:33:15,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:15,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:15,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:15,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:15,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:15,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843111737] [2025-03-08 07:33:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843111737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697771156] [2025-03-08 07:33:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:15,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:15,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:15,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:15,526 INFO L87 Difference]: Start difference. First operand 416 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:16,116 INFO L93 Difference]: Finished difference Result 721 states and 1034 transitions. [2025-03-08 07:33:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:16,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:16,121 INFO L225 Difference]: With dead ends: 721 [2025-03-08 07:33:16,121 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 07:33:16,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-03-08 07:33:16,122 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 724 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:16,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1260 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 07:33:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 508. [2025-03-08 07:33:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 417 states have (on average 1.486810551558753) internal successors, (620), 426 states have internal predecessors, (620), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2025-03-08 07:33:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 745 transitions. [2025-03-08 07:33:16,162 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 745 transitions. Word has length 62 [2025-03-08 07:33:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:16,163 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 745 transitions. [2025-03-08 07:33:16,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 745 transitions. [2025-03-08 07:33:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:16,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:16,166 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] [2025-03-08 07:33:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:33:16,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash -469132168, now seen corresponding path program 1 times [2025-03-08 07:33:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861254793] [2025-03-08 07:33:16,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:16,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:16,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:16,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861254793] [2025-03-08 07:33:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861254793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:16,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:16,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597004573] [2025-03-08 07:33:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:16,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:16,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:16,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:16,253 INFO L87 Difference]: Start difference. First operand 508 states and 745 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:16,292 INFO L93 Difference]: Finished difference Result 768 states and 1106 transitions. [2025-03-08 07:33:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:16,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 07:33:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:16,296 INFO L225 Difference]: With dead ends: 768 [2025-03-08 07:33:16,296 INFO L226 Difference]: Without dead ends: 513 [2025-03-08 07:33:16,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-08 07:33:16,297 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:16,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2415 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-08 07:33:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-03-08 07:33:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 421 states have (on average 1.477434679334917) internal successors, (622), 430 states have internal predecessors, (622), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (68), 57 states have call predecessors, (68), 54 states have call successors, (68) [2025-03-08 07:33:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 748 transitions. [2025-03-08 07:33:16,333 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 748 transitions. Word has length 62 [2025-03-08 07:33:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:16,333 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 748 transitions. [2025-03-08 07:33:16,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 748 transitions. [2025-03-08 07:33:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:16,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:16,337 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] [2025-03-08 07:33:16,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:33:16,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:16,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1256348729, now seen corresponding path program 1 times [2025-03-08 07:33:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:16,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620973489] [2025-03-08 07:33:16,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:16,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:16,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:16,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:16,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:16,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620973489] [2025-03-08 07:33:16,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620973489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:16,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:16,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:33:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524746170] [2025-03-08 07:33:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:16,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:33:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:16,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:33:16,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:33:16,448 INFO L87 Difference]: Start difference. First operand 513 states and 748 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:33:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:17,453 INFO L93 Difference]: Finished difference Result 1695 states and 2384 transitions. [2025-03-08 07:33:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:33:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-03-08 07:33:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:17,462 INFO L225 Difference]: With dead ends: 1695 [2025-03-08 07:33:17,462 INFO L226 Difference]: Without dead ends: 1417 [2025-03-08 07:33:17,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:33:17,466 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2201 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:17,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 1405 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:33:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2025-03-08 07:33:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1369. [2025-03-08 07:33:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1091 states have (on average 1.38955087076077) internal successors, (1516), 1115 states have internal predecessors, (1516), 146 states have call successors, (146), 112 states have call predecessors, (146), 130 states have return successors, (182), 144 states have call predecessors, (182), 142 states have call successors, (182) [2025-03-08 07:33:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1844 transitions. [2025-03-08 07:33:17,572 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1844 transitions. Word has length 62 [2025-03-08 07:33:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:17,572 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1844 transitions. [2025-03-08 07:33:17,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:33:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1844 transitions. [2025-03-08 07:33:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:17,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:17,574 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] [2025-03-08 07:33:17,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:33:17,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:17,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1455354986, now seen corresponding path program 1 times [2025-03-08 07:33:17,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:17,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672745313] [2025-03-08 07:33:17,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:17,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:17,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:17,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:17,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:17,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672745313] [2025-03-08 07:33:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672745313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:17,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889638190] [2025-03-08 07:33:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:17,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:17,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:17,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:17,658 INFO L87 Difference]: Start difference. First operand 1369 states and 1844 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:17,750 INFO L93 Difference]: Finished difference Result 2527 states and 3365 transitions. [2025-03-08 07:33:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 07:33:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:17,758 INFO L225 Difference]: With dead ends: 2527 [2025-03-08 07:33:17,758 INFO L226 Difference]: Without dead ends: 1399 [2025-03-08 07:33:17,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-08 07:33:17,762 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:17,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2415 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-08 07:33:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1399. [2025-03-08 07:33:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1115 states have (on average 1.3739910313901345) internal successors, (1532), 1139 states have internal predecessors, (1532), 146 states have call successors, (146), 112 states have call predecessors, (146), 136 states have return successors, (188), 150 states have call predecessors, (188), 142 states have call successors, (188) [2025-03-08 07:33:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1866 transitions. [2025-03-08 07:33:17,836 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1866 transitions. Word has length 62 [2025-03-08 07:33:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:17,837 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 1866 transitions. [2025-03-08 07:33:17,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1866 transitions. [2025-03-08 07:33:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:17,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:17,838 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] [2025-03-08 07:33:17,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:33:17,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1424335179, now seen corresponding path program 1 times [2025-03-08 07:33:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030798735] [2025-03-08 07:33:17,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:17,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:17,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:17,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:17,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030798735] [2025-03-08 07:33:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030798735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:17,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986822559] [2025-03-08 07:33:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:17,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:17,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:17,971 INFO L87 Difference]: Start difference. First operand 1399 states and 1866 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:18,573 INFO L93 Difference]: Finished difference Result 2571 states and 3322 transitions. [2025-03-08 07:33:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:33:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:18,582 INFO L225 Difference]: With dead ends: 2571 [2025-03-08 07:33:18,582 INFO L226 Difference]: Without dead ends: 1625 [2025-03-08 07:33:18,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:33:18,585 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 709 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:18,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1066 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2025-03-08 07:33:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1344. [2025-03-08 07:33:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1076 states have (on average 1.3698884758364311) internal successors, (1474), 1095 states have internal predecessors, (1474), 140 states have call successors, (140), 107 states have call predecessors, (140), 126 states have return successors, (173), 143 states have call predecessors, (173), 136 states have call successors, (173) [2025-03-08 07:33:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1787 transitions. [2025-03-08 07:33:18,654 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1787 transitions. Word has length 62 [2025-03-08 07:33:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:18,654 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1787 transitions. [2025-03-08 07:33:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1787 transitions. [2025-03-08 07:33:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:18,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:18,655 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] [2025-03-08 07:33:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:33:18,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:18,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1212984266, now seen corresponding path program 1 times [2025-03-08 07:33:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:18,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438604788] [2025-03-08 07:33:18,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:18,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:18,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:18,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438604788] [2025-03-08 07:33:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438604788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:18,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014868970] [2025-03-08 07:33:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:18,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:18,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:18,703 INFO L87 Difference]: Start difference. First operand 1344 states and 1787 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:19,086 INFO L93 Difference]: Finished difference Result 3475 states and 4526 transitions. [2025-03-08 07:33:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:33:19,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-03-08 07:33:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:19,099 INFO L225 Difference]: With dead ends: 3475 [2025-03-08 07:33:19,099 INFO L226 Difference]: Without dead ends: 2373 [2025-03-08 07:33:19,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:19,102 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 670 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:19,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 544 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:33:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-08 07:33:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2369. [2025-03-08 07:33:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 1858 states have (on average 1.3067814854682454) internal successors, (2428), 1894 states have internal predecessors, (2428), 259 states have call successors, (259), 206 states have call predecessors, (259), 250 states have return successors, (364), 271 states have call predecessors, (364), 255 states have call successors, (364) [2025-03-08 07:33:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3051 transitions. [2025-03-08 07:33:19,219 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3051 transitions. Word has length 62 [2025-03-08 07:33:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:19,219 INFO L471 AbstractCegarLoop]: Abstraction has 2369 states and 3051 transitions. [2025-03-08 07:33:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:33:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3051 transitions. [2025-03-08 07:33:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:33:19,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:19,220 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] [2025-03-08 07:33:19,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:33:19,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:19,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash -759986358, now seen corresponding path program 1 times [2025-03-08 07:33:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:19,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229498858] [2025-03-08 07:33:19,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:19,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:19,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:33:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:33:19,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229498858] [2025-03-08 07:33:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229498858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:19,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:19,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:19,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720447919] [2025-03-08 07:33:19,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:19,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:19,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:19,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:19,256 INFO L87 Difference]: Start difference. First operand 2369 states and 3051 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:19,401 INFO L93 Difference]: Finished difference Result 5353 states and 6836 transitions. [2025-03-08 07:33:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-08 07:33:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:19,418 INFO L225 Difference]: With dead ends: 5353 [2025-03-08 07:33:19,419 INFO L226 Difference]: Without dead ends: 3231 [2025-03-08 07:33:19,424 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-03-08 07:33:19,425 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 101 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:19,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 941 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2025-03-08 07:33:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3163. [2025-03-08 07:33:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 2466 states have (on average 1.2907542579075426) internal successors, (3183), 2507 states have internal predecessors, (3183), 351 states have call successors, (351), 286 states have call predecessors, (351), 344 states have return successors, (478), 372 states have call predecessors, (478), 347 states have call successors, (478) [2025-03-08 07:33:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 4012 transitions. [2025-03-08 07:33:19,633 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 4012 transitions. Word has length 63 [2025-03-08 07:33:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 3163 states and 4012 transitions. [2025-03-08 07:33:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:33:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 4012 transitions. [2025-03-08 07:33:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:33:19,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:19,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:19,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:33:19,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:19,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1240946356, now seen corresponding path program 1 times [2025-03-08 07:33:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:19,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906094288] [2025-03-08 07:33:19,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:19,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:33:19,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:33:19,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:19,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906094288] [2025-03-08 07:33:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906094288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:19,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279948435] [2025-03-08 07:33:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:19,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:19,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:19,728 INFO L87 Difference]: Start difference. First operand 3163 states and 4012 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:20,083 INFO L93 Difference]: Finished difference Result 4088 states and 5130 transitions. [2025-03-08 07:33:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:33:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-03-08 07:33:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:20,102 INFO L225 Difference]: With dead ends: 4088 [2025-03-08 07:33:20,103 INFO L226 Difference]: Without dead ends: 4085 [2025-03-08 07:33:20,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:20,105 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 894 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:20,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 588 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:33:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2025-03-08 07:33:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3613. [2025-03-08 07:33:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2809 states have (on average 1.2791028835884657) internal successors, (3593), 2853 states have internal predecessors, (3593), 401 states have call successors, (401), 330 states have call predecessors, (401), 401 states have return successors, (555), 432 states have call predecessors, (555), 398 states have call successors, (555) [2025-03-08 07:33:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 4549 transitions. [2025-03-08 07:33:20,332 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 4549 transitions. Word has length 68 [2025-03-08 07:33:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:20,332 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 4549 transitions. [2025-03-08 07:33:20,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 4549 transitions. [2025-03-08 07:33:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:33:20,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:20,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:20,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:33:20,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 184950726, now seen corresponding path program 1 times [2025-03-08 07:33:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:20,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776426233] [2025-03-08 07:33:20,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:20,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:20,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:20,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:20,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776426233] [2025-03-08 07:33:20,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776426233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451842806] [2025-03-08 07:33:20,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:20,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:20,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:33:20,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:33:20,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:20,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:20,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:20,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:20,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:33:20,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:20,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:33:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451842806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:33:20,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:33:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-08 07:33:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479541001] [2025-03-08 07:33:20,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:33:20,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:20,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:20,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:20,812 INFO L87 Difference]: Start difference. First operand 3613 states and 4549 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:33:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:21,414 INFO L93 Difference]: Finished difference Result 7437 states and 9225 transitions. [2025-03-08 07:33:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:33:21,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-03-08 07:33:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:21,445 INFO L225 Difference]: With dead ends: 7437 [2025-03-08 07:33:21,445 INFO L226 Difference]: Without dead ends: 7434 [2025-03-08 07:33:21,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:21,448 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 926 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:21,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1907 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:33:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2025-03-08 07:33:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 7053. [2025-03-08 07:33:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7053 states, 5471 states have (on average 1.2580881008956315) internal successors, (6883), 5550 states have internal predecessors, (6883), 778 states have call successors, (778), 660 states have call predecessors, (778), 802 states have return successors, (1080), 845 states have call predecessors, (1080), 775 states have call successors, (1080) [2025-03-08 07:33:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7053 states to 7053 states and 8741 transitions. [2025-03-08 07:33:21,920 INFO L78 Accepts]: Start accepts. Automaton has 7053 states and 8741 transitions. Word has length 69 [2025-03-08 07:33:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:21,920 INFO L471 AbstractCegarLoop]: Abstraction has 7053 states and 8741 transitions. [2025-03-08 07:33:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 07:33:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7053 states and 8741 transitions. [2025-03-08 07:33:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:33:21,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:21,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:21,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:33:22,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 07:33:22,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1496893673, now seen corresponding path program 2 times [2025-03-08 07:33:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505045796] [2025-03-08 07:33:22,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:33:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:22,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 07:33:22,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:33:22,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:33:22,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:22,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505045796] [2025-03-08 07:33:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505045796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:22,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:22,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774331218] [2025-03-08 07:33:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:22,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:22,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:22,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:22,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:22,152 INFO L87 Difference]: Start difference. First operand 7053 states and 8741 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:22,375 INFO L93 Difference]: Finished difference Result 9348 states and 11634 transitions. [2025-03-08 07:33:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:22,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-03-08 07:33:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:22,395 INFO L225 Difference]: With dead ends: 9348 [2025-03-08 07:33:22,395 INFO L226 Difference]: Without dead ends: 3412 [2025-03-08 07:33:22,408 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-03-08 07:33:22,409 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 456 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:22,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 672 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2025-03-08 07:33:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 2681. [2025-03-08 07:33:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2101 states have (on average 1.2641599238457877) internal successors, (2656), 2126 states have internal predecessors, (2656), 299 states have call successors, (299), 244 states have call predecessors, (299), 279 states have return successors, (382), 313 states have call predecessors, (382), 296 states have call successors, (382) [2025-03-08 07:33:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3337 transitions. [2025-03-08 07:33:22,589 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3337 transitions. Word has length 71 [2025-03-08 07:33:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:22,589 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 3337 transitions. [2025-03-08 07:33:22,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 07:33:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3337 transitions. [2025-03-08 07:33:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:33:22,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:22,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:33:22,591 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -142447179, now seen corresponding path program 1 times [2025-03-08 07:33:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940539523] [2025-03-08 07:33:22,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:22,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:33:22,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:33:22,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:22,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:33:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940539523] [2025-03-08 07:33:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940539523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586010820] [2025-03-08 07:33:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:22,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:22,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:22,712 INFO L87 Difference]: Start difference. First operand 2681 states and 3337 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:23,615 INFO L93 Difference]: Finished difference Result 7601 states and 9350 transitions. [2025-03-08 07:33:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:33:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-03-08 07:33:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:23,637 INFO L225 Difference]: With dead ends: 7601 [2025-03-08 07:33:23,638 INFO L226 Difference]: Without dead ends: 4413 [2025-03-08 07:33:23,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:33:23,647 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 710 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:23,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1371 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2025-03-08 07:33:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4236. [2025-03-08 07:33:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4236 states, 3286 states have (on average 1.22915398660986) internal successors, (4039), 3341 states have internal predecessors, (4039), 474 states have call successors, (474), 398 states have call predecessors, (474), 474 states have return successors, (672), 499 states have call predecessors, (672), 471 states have call successors, (672) [2025-03-08 07:33:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4236 states to 4236 states and 5185 transitions. [2025-03-08 07:33:24,051 INFO L78 Accepts]: Start accepts. Automaton has 4236 states and 5185 transitions. Word has length 80 [2025-03-08 07:33:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:24,052 INFO L471 AbstractCegarLoop]: Abstraction has 4236 states and 5185 transitions. [2025-03-08 07:33:24,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4236 states and 5185 transitions. [2025-03-08 07:33:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:33:24,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:24,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:33:24,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1397265988, now seen corresponding path program 1 times [2025-03-08 07:33:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289882970] [2025-03-08 07:33:24,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:24,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:33:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:33:24,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:24,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 07:33:24,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289882970] [2025-03-08 07:33:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289882970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:24,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:24,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:33:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389795426] [2025-03-08 07:33:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:24,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:24,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:24,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:24,158 INFO L87 Difference]: Start difference. First operand 4236 states and 5185 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:25,110 INFO L93 Difference]: Finished difference Result 7183 states and 8760 transitions. [2025-03-08 07:33:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:33:25,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-03-08 07:33:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:25,122 INFO L225 Difference]: With dead ends: 7183 [2025-03-08 07:33:25,122 INFO L226 Difference]: Without dead ends: 3405 [2025-03-08 07:33:25,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:33:25,127 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 1322 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:25,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1444 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2025-03-08 07:33:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3084. [2025-03-08 07:33:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2392 states have (on average 1.2173913043478262) internal successors, (2912), 2434 states have internal predecessors, (2912), 343 states have call successors, (343), 281 states have call predecessors, (343), 347 states have return successors, (461), 371 states have call predecessors, (461), 340 states have call successors, (461) [2025-03-08 07:33:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 3716 transitions. [2025-03-08 07:33:25,294 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 3716 transitions. Word has length 86 [2025-03-08 07:33:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:25,294 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 3716 transitions. [2025-03-08 07:33:25,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:33:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 3716 transitions. [2025-03-08 07:33:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:25,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:25,298 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-03-08 07:33:25,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:33:25,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash -126970419, now seen corresponding path program 1 times [2025-03-08 07:33:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960235856] [2025-03-08 07:33:25,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:25,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:25,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:25,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:25,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:25,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-03-08 07:33:25,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:25,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960235856] [2025-03-08 07:33:25,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960235856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:25,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:25,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:25,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625919676] [2025-03-08 07:33:25,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:25,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:25,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:25,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:25,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:25,383 INFO L87 Difference]: Start difference. First operand 3084 states and 3716 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-03-08 07:33:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:25,866 INFO L93 Difference]: Finished difference Result 3544 states and 4438 transitions. [2025-03-08 07:33:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:25,867 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-03-08 07:33:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:25,887 INFO L225 Difference]: With dead ends: 3544 [2025-03-08 07:33:25,887 INFO L226 Difference]: Without dead ends: 3326 [2025-03-08 07:33:25,889 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-03-08 07:33:25,890 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 815 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:25,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1136 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:33:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2025-03-08 07:33:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3307. [2025-03-08 07:33:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2593 states have (on average 1.2456613960663325) internal successors, (3230), 2636 states have internal predecessors, (3230), 358 states have call successors, (358), 287 states have call predecessors, (358), 354 states have return successors, (477), 386 states have call predecessors, (477), 355 states have call successors, (477) [2025-03-08 07:33:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4065 transitions. [2025-03-08 07:33:26,083 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4065 transitions. Word has length 111 [2025-03-08 07:33:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:26,084 INFO L471 AbstractCegarLoop]: Abstraction has 3307 states and 4065 transitions. [2025-03-08 07:33:26,084 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-03-08 07:33:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4065 transitions. [2025-03-08 07:33:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:26,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:26,086 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-03-08 07:33:26,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:33:26,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:26,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1348405579, now seen corresponding path program 1 times [2025-03-08 07:33:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827021086] [2025-03-08 07:33:26,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:26,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:26,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:26,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827021086] [2025-03-08 07:33:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827021086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:26,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:26,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:26,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916456531] [2025-03-08 07:33:26,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:26,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:26,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:26,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:26,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:26,179 INFO L87 Difference]: Start difference. First operand 3307 states and 4065 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:26,835 INFO L93 Difference]: Finished difference Result 4031 states and 5209 transitions. [2025-03-08 07:33:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:26,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:26,847 INFO L225 Difference]: With dead ends: 4031 [2025-03-08 07:33:26,847 INFO L226 Difference]: Without dead ends: 3590 [2025-03-08 07:33:26,849 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-03-08 07:33:26,849 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 812 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:26,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 2074 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2025-03-08 07:33:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3515. [2025-03-08 07:33:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3515 states, 2779 states have (on average 1.2659229938826917) internal successors, (3518), 2823 states have internal predecessors, (3518), 373 states have call successors, (373), 293 states have call predecessors, (373), 361 states have return successors, (495), 402 states have call predecessors, (495), 370 states have call successors, (495) [2025-03-08 07:33:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 4386 transitions. [2025-03-08 07:33:27,085 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 4386 transitions. Word has length 111 [2025-03-08 07:33:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:27,085 INFO L471 AbstractCegarLoop]: Abstraction has 3515 states and 4386 transitions. [2025-03-08 07:33:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 4386 transitions. [2025-03-08 07:33:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:27,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:27,088 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-03-08 07:33:27,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:33:27,088 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:27,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash 906651084, now seen corresponding path program 1 times [2025-03-08 07:33:27,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082037927] [2025-03-08 07:33:27,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:27,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:27,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:27,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:27,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082037927] [2025-03-08 07:33:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082037927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:27,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497639289] [2025-03-08 07:33:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:27,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:27,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:27,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:27,194 INFO L87 Difference]: Start difference. First operand 3515 states and 4386 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:27,907 INFO L93 Difference]: Finished difference Result 4689 states and 6239 transitions. [2025-03-08 07:33:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:27,920 INFO L225 Difference]: With dead ends: 4689 [2025-03-08 07:33:27,920 INFO L226 Difference]: Without dead ends: 4040 [2025-03-08 07:33:27,923 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-03-08 07:33:27,924 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 807 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:27,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 2058 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2025-03-08 07:33:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3956. [2025-03-08 07:33:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 3174 states have (on average 1.3034026465028354) internal successors, (4137), 3222 states have internal predecessors, (4137), 403 states have call successors, (403), 305 states have call predecessors, (403), 377 states have return successors, (537), 434 states have call predecessors, (537), 400 states have call successors, (537) [2025-03-08 07:33:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 5077 transitions. [2025-03-08 07:33:28,272 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 5077 transitions. Word has length 111 [2025-03-08 07:33:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:28,272 INFO L471 AbstractCegarLoop]: Abstraction has 3956 states and 5077 transitions. [2025-03-08 07:33:28,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 5077 transitions. [2025-03-08 07:33:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:28,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:28,276 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-03-08 07:33:28,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:33:28,277 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:28,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash 892400939, now seen corresponding path program 1 times [2025-03-08 07:33:28,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:28,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272004090] [2025-03-08 07:33:28,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:28,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:28,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:28,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:28,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272004090] [2025-03-08 07:33:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272004090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:28,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:28,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136516205] [2025-03-08 07:33:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:28,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:28,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:28,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:28,380 INFO L87 Difference]: Start difference. First operand 3956 states and 5077 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:29,081 INFO L93 Difference]: Finished difference Result 6100 states and 8492 transitions. [2025-03-08 07:33:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:29,096 INFO L225 Difference]: With dead ends: 6100 [2025-03-08 07:33:29,096 INFO L226 Difference]: Without dead ends: 5010 [2025-03-08 07:33:29,099 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-03-08 07:33:29,099 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 802 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:29,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 2046 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2025-03-08 07:33:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 4907. [2025-03-08 07:33:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4907 states, 4027 states have (on average 1.3640427116960516) internal successors, (5493), 4089 states have internal predecessors, (5493), 463 states have call successors, (463), 329 states have call predecessors, (463), 415 states have return successors, (645), 498 states have call predecessors, (645), 460 states have call successors, (645) [2025-03-08 07:33:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 6601 transitions. [2025-03-08 07:33:29,364 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 6601 transitions. Word has length 111 [2025-03-08 07:33:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:29,364 INFO L471 AbstractCegarLoop]: Abstraction has 4907 states and 6601 transitions. [2025-03-08 07:33:29,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 6601 transitions. [2025-03-08 07:33:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:29,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:29,368 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-03-08 07:33:29,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:33:29,368 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:29,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash -77890068, now seen corresponding path program 1 times [2025-03-08 07:33:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496243152] [2025-03-08 07:33:29,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:29,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:29,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:29,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:29,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496243152] [2025-03-08 07:33:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496243152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:29,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:29,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503292001] [2025-03-08 07:33:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:29,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:29,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:29,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:29,459 INFO L87 Difference]: Start difference. First operand 4907 states and 6601 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:30,218 INFO L93 Difference]: Finished difference Result 9179 states and 13554 transitions. [2025-03-08 07:33:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:30,242 INFO L225 Difference]: With dead ends: 9179 [2025-03-08 07:33:30,242 INFO L226 Difference]: Without dead ends: 7138 [2025-03-08 07:33:30,250 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-03-08 07:33:30,250 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 797 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:30,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2034 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7138 states. [2025-03-08 07:33:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7138 to 6998. [2025-03-08 07:33:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 5904 states have (on average 1.4439363143631436) internal successors, (8525), 6012 states have internal predecessors, (8525), 583 states have call successors, (583), 377 states have call predecessors, (583), 509 states have return successors, (957), 626 states have call predecessors, (957), 580 states have call successors, (957) [2025-03-08 07:33:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 10065 transitions. [2025-03-08 07:33:30,653 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 10065 transitions. Word has length 111 [2025-03-08 07:33:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:30,653 INFO L471 AbstractCegarLoop]: Abstraction has 6998 states and 10065 transitions. [2025-03-08 07:33:30,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 10065 transitions. [2025-03-08 07:33:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:30,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:30,658 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-03-08 07:33:30,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:33:30,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:30,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 860641547, now seen corresponding path program 1 times [2025-03-08 07:33:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:30,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497944191] [2025-03-08 07:33:30,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:30,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:30,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:30,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:30,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497944191] [2025-03-08 07:33:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497944191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:30,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323917424] [2025-03-08 07:33:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:30,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:30,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:30,730 INFO L87 Difference]: Start difference. First operand 6998 states and 10065 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-03-08 07:33:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:31,406 INFO L93 Difference]: Finished difference Result 11960 states and 18453 transitions. [2025-03-08 07:33:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:33:31,407 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-03-08 07:33:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:31,433 INFO L225 Difference]: With dead ends: 11960 [2025-03-08 07:33:31,433 INFO L226 Difference]: Without dead ends: 7828 [2025-03-08 07:33:31,444 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-03-08 07:33:31,444 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 628 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:31,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 839 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:33:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7828 states. [2025-03-08 07:33:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7828 to 6998. [2025-03-08 07:33:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 5904 states have (on average 1.4410569105691058) internal successors, (8508), 6012 states have internal predecessors, (8508), 583 states have call successors, (583), 377 states have call predecessors, (583), 509 states have return successors, (957), 626 states have call predecessors, (957), 580 states have call successors, (957) [2025-03-08 07:33:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 10048 transitions. [2025-03-08 07:33:31,987 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 10048 transitions. Word has length 111 [2025-03-08 07:33:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:31,987 INFO L471 AbstractCegarLoop]: Abstraction has 6998 states and 10048 transitions. [2025-03-08 07:33:31,987 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-03-08 07:33:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 10048 transitions. [2025-03-08 07:33:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:31,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:31,992 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-03-08 07:33:31,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:33:31,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:31,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash 475274764, now seen corresponding path program 1 times [2025-03-08 07:33:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765719309] [2025-03-08 07:33:31,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:32,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:32,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:32,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:32,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:32,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765719309] [2025-03-08 07:33:32,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765719309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:32,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:32,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412766117] [2025-03-08 07:33:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:32,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:32,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:32,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:32,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:32,063 INFO L87 Difference]: Start difference. First operand 6998 states and 10048 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-03-08 07:33:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:32,699 INFO L93 Difference]: Finished difference Result 11877 states and 18253 transitions. [2025-03-08 07:33:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:33:32,700 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-03-08 07:33:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:32,732 INFO L225 Difference]: With dead ends: 11877 [2025-03-08 07:33:32,733 INFO L226 Difference]: Without dead ends: 7745 [2025-03-08 07:33:32,743 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-03-08 07:33:32,744 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 625 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:32,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 831 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:33:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7745 states. [2025-03-08 07:33:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7745 to 6998. [2025-03-08 07:33:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 5904 states have (on average 1.4381775067750677) internal successors, (8491), 6012 states have internal predecessors, (8491), 583 states have call successors, (583), 377 states have call predecessors, (583), 509 states have return successors, (957), 626 states have call predecessors, (957), 580 states have call successors, (957) [2025-03-08 07:33:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 10031 transitions. [2025-03-08 07:33:33,173 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 10031 transitions. Word has length 111 [2025-03-08 07:33:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:33,173 INFO L471 AbstractCegarLoop]: Abstraction has 6998 states and 10031 transitions. [2025-03-08 07:33:33,173 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-03-08 07:33:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 10031 transitions. [2025-03-08 07:33:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:33,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:33,177 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-03-08 07:33:33,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:33:33,177 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:33,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2125411563, now seen corresponding path program 1 times [2025-03-08 07:33:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717464638] [2025-03-08 07:33:33,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:33,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:33,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:33,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:33,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:33,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717464638] [2025-03-08 07:33:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717464638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:33,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:33,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523573346] [2025-03-08 07:33:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:33,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:33,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:33,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:33,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:33,253 INFO L87 Difference]: Start difference. First operand 6998 states and 10031 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:34,310 INFO L93 Difference]: Finished difference Result 16586 states and 25959 transitions. [2025-03-08 07:33:34,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:34,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:34,349 INFO L225 Difference]: With dead ends: 16586 [2025-03-08 07:33:34,350 INFO L226 Difference]: Without dead ends: 12454 [2025-03-08 07:33:34,360 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-03-08 07:33:34,361 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 970 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:34,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1971 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12454 states. [2025-03-08 07:33:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12454 to 11483. [2025-03-08 07:33:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11483 states, 9923 states have (on average 1.5139574725385467) internal successors, (15023), 10177 states have internal predecessors, (15023), 807 states have call successors, (807), 473 states have call predecessors, (807), 751 states have return successors, (1949), 866 states have call predecessors, (1949), 804 states have call successors, (1949) [2025-03-08 07:33:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 17779 transitions. [2025-03-08 07:33:34,943 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 17779 transitions. Word has length 111 [2025-03-08 07:33:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 11483 states and 17779 transitions. [2025-03-08 07:33:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 17779 transitions. [2025-03-08 07:33:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:35,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:35,017 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-03-08 07:33:35,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:33:35,018 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:35,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash -315210196, now seen corresponding path program 1 times [2025-03-08 07:33:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116637282] [2025-03-08 07:33:35,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:35,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:35,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:35,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:35,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:35,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116637282] [2025-03-08 07:33:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116637282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:35,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885737163] [2025-03-08 07:33:35,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:35,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:35,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:35,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:35,112 INFO L87 Difference]: Start difference. First operand 11483 states and 17779 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:36,769 INFO L93 Difference]: Finished difference Result 31683 states and 53297 transitions. [2025-03-08 07:33:36,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:36,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:36,846 INFO L225 Difference]: With dead ends: 31683 [2025-03-08 07:33:36,847 INFO L226 Difference]: Without dead ends: 23066 [2025-03-08 07:33:36,869 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-03-08 07:33:36,871 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 934 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:36,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1955 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23066 states. [2025-03-08 07:33:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23066 to 21170. [2025-03-08 07:33:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21170 states, 18532 states have (on average 1.5710662637599828) internal successors, (29115), 19240 states have internal predecessors, (29115), 1239 states have call successors, (1239), 665 states have call predecessors, (1239), 1397 states have return successors, (5453), 1330 states have call predecessors, (5453), 1236 states have call successors, (5453) [2025-03-08 07:33:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21170 states to 21170 states and 35807 transitions. [2025-03-08 07:33:38,089 INFO L78 Accepts]: Start accepts. Automaton has 21170 states and 35807 transitions. Word has length 111 [2025-03-08 07:33:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:38,090 INFO L471 AbstractCegarLoop]: Abstraction has 21170 states and 35807 transitions. [2025-03-08 07:33:38,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 21170 states and 35807 transitions. [2025-03-08 07:33:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:38,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:38,099 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-03-08 07:33:38,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:33:38,100 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:38,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash 852986059, now seen corresponding path program 1 times [2025-03-08 07:33:38,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:38,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135484952] [2025-03-08 07:33:38,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:38,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:38,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:38,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:38,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:38,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:38,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135484952] [2025-03-08 07:33:38,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135484952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:38,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790010456] [2025-03-08 07:33:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:38,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:38,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:38,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:38,178 INFO L87 Difference]: Start difference. First operand 21170 states and 35807 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:41,008 INFO L93 Difference]: Finished difference Result 64438 states and 118991 transitions. [2025-03-08 07:33:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:41,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:41,219 INFO L225 Difference]: With dead ends: 64438 [2025-03-08 07:33:41,219 INFO L226 Difference]: Without dead ends: 46134 [2025-03-08 07:33:41,277 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-03-08 07:33:41,278 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 900 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:41,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1947 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46134 states. [2025-03-08 07:33:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46134 to 43409. [2025-03-08 07:33:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43409 states, 38161 states have (on average 1.6151306307486701) internal successors, (61635), 40263 states have internal predecessors, (61635), 2071 states have call successors, (2071), 1049 states have call predecessors, (2071), 3175 states have return successors, (18573), 2226 states have call predecessors, (18573), 2068 states have call successors, (18573) [2025-03-08 07:33:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43409 states to 43409 states and 82279 transitions. [2025-03-08 07:33:43,788 INFO L78 Accepts]: Start accepts. Automaton has 43409 states and 82279 transitions. Word has length 111 [2025-03-08 07:33:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:43,788 INFO L471 AbstractCegarLoop]: Abstraction has 43409 states and 82279 transitions. [2025-03-08 07:33:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 43409 states and 82279 transitions. [2025-03-08 07:33:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:43,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:43,801 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-03-08 07:33:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:33:43,801 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash -356256180, now seen corresponding path program 1 times [2025-03-08 07:33:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:43,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367292532] [2025-03-08 07:33:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:43,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367292532] [2025-03-08 07:33:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367292532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831303792] [2025-03-08 07:33:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:43,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:43,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:43,871 INFO L87 Difference]: Start difference. First operand 43409 states and 82279 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:49,857 INFO L93 Difference]: Finished difference Result 139185 states and 294029 transitions. [2025-03-08 07:33:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:49,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:50,316 INFO L225 Difference]: With dead ends: 139185 [2025-03-08 07:33:50,317 INFO L226 Difference]: Without dead ends: 98642 [2025-03-08 07:33:50,408 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-03-08 07:33:50,408 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 865 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:50,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 1935 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98642 states. [2025-03-08 07:33:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98642 to 94256. [2025-03-08 07:33:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94256 states, 82394 states have (on average 1.6412724227492292) internal successors, (135231), 88742 states have internal predecessors, (135231), 3671 states have call successors, (3671), 1817 states have call predecessors, (3671), 8189 states have return successors, (69325), 3954 states have call predecessors, (69325), 3668 states have call successors, (69325) [2025-03-08 07:33:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94256 states to 94256 states and 208227 transitions. [2025-03-08 07:33:57,891 INFO L78 Accepts]: Start accepts. Automaton has 94256 states and 208227 transitions. Word has length 111 [2025-03-08 07:33:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:57,892 INFO L471 AbstractCegarLoop]: Abstraction has 94256 states and 208227 transitions. [2025-03-08 07:33:57,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) 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-03-08 07:33:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 94256 states and 208227 transitions. [2025-03-08 07:33:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 07:33:57,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:57,920 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-03-08 07:33:57,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:33:57,920 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:57,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 851661995, now seen corresponding path program 1 times [2025-03-08 07:33:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075376220] [2025-03-08 07:33:57,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:57,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 07:33:57,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 07:33:57,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:57,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075376220] [2025-03-08 07:33:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075376220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:57,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:57,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868814227] [2025-03-08 07:33:57,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:57,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:57,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:57,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:57,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:57,988 INFO L87 Difference]: Start difference. First operand 94256 states and 208227 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) 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)