./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:54:44,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:54:44,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:54:44,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:54:44,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:54:44,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:54:44,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:54:44,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:54:44,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:54:44,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:54:44,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:54:44,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:54:44,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:54:44,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:44,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:54:44,428 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd [2025-02-05 17:54:44,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:54:44,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:54:44,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:54:44,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:54:44,659 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:54:44,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2025-02-05 17:54:45,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a032630a/3491c124bc124bbab4c2677a841b3510/FLAG964b7685a [2025-02-05 17:54:46,133 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:54:46,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2025-02-05 17:54:46,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a032630a/3491c124bc124bbab4c2677a841b3510/FLAG964b7685a [2025-02-05 17:54:46,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a032630a/3491c124bc124bbab4c2677a841b3510 [2025-02-05 17:54:46,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:54:46,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:54:46,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:46,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:54:46,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:54:46,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8a2b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46, skipping insertion in model container [2025-02-05 17:54:46,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:54:46,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[914,927] [2025-02-05 17:54:46,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[7115,7128] [2025-02-05 17:54:46,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:46,437 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:54:46,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[914,927] [2025-02-05 17:54:46,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[7115,7128] [2025-02-05 17:54:46,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:46,531 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:54:46,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46 WrapperNode [2025-02-05 17:54:46,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:46,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:46,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:54:46,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:54:46,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,580 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 732 [2025-02-05 17:54:46,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:46,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:54:46,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:54:46,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:54:46,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,611 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-02-05 17:54:46,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:54:46,635 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:54:46,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:54:46,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:54:46,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (1/1) ... [2025-02-05 17:54:46,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:54:46,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:54:46,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:54:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:54:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:54:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:54:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:54:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:54:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:54:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:54:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:54:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:54:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:54:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:54:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:54:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:54:46,769 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:54:46,771 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:54:47,351 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-02-05 17:54:47,351 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:54:47,363 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:54:47,363 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:54:47,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:47 BoogieIcfgContainer [2025-02-05 17:54:47,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:54:47,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:54:47,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:54:47,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:54:47,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:54:46" (1/3) ... [2025-02-05 17:54:47,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e6b149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:47, skipping insertion in model container [2025-02-05 17:54:47,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:46" (2/3) ... [2025-02-05 17:54:47,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e6b149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:47, skipping insertion in model container [2025-02-05 17:54:47,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:47" (3/3) ... [2025-02-05 17:54:47,373 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2025-02-05 17:54:47,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:54:47,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.07.cil-2.c that has 16 procedures, 384 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-02-05 17:54:47,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:54:47,472 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;@5e84b261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:54:47,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:54:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 385 states, 329 states have (on average 1.5440729483282676) internal successors, (508), 338 states have internal predecessors, (508), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 17:54:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:47,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:47,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:47,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:47,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash -886131162, now seen corresponding path program 1 times [2025-02-05 17:54:47,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:47,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955181782] [2025-02-05 17:54:47,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:47,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:47,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:47,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:47,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:47,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:47,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955181782] [2025-02-05 17:54:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955181782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:47,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448987625] [2025-02-05 17:54:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:47,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:47,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:47,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:47,738 INFO L87 Difference]: Start difference. First operand has 385 states, 329 states have (on average 1.5440729483282676) internal successors, (508), 338 states have internal predecessors, (508), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:47,814 INFO L93 Difference]: Finished difference Result 747 states and 1127 transitions. [2025-02-05 17:54:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:54:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:47,831 INFO L225 Difference]: With dead ends: 747 [2025-02-05 17:54:47,832 INFO L226 Difference]: Without dead ends: 373 [2025-02-05 17:54:47,838 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-02-05 17:54:47,842 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 133 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:47,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 981 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-05 17:54:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-02-05 17:54:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 321 states have (on average 1.4953271028037383) internal successors, (480), 326 states have internal predecessors, (480), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 17:54:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2025-02-05 17:54:47,907 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 65 [2025-02-05 17:54:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:47,909 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2025-02-05 17:54:47,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2025-02-05 17:54:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:47,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:47,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:47,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:54:47,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:47,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:47,913 INFO L85 PathProgramCache]: Analyzing trace with hash -906468537, now seen corresponding path program 1 times [2025-02-05 17:54:47,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489286560] [2025-02-05 17:54:47,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:47,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:47,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:47,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:47,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:47,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489286560] [2025-02-05 17:54:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489286560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:48,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002577044] [2025-02-05 17:54:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:48,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:48,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:48,131 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-02-05 17:54:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:48,795 INFO L93 Difference]: Finished difference Result 568 states and 820 transitions. [2025-02-05 17:54:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2025-02-05 17:54:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:48,802 INFO L225 Difference]: With dead ends: 568 [2025-02-05 17:54:48,802 INFO L226 Difference]: Without dead ends: 478 [2025-02-05 17:54:48,804 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-02-05 17:54:48,805 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 376 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:48,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1213 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-05 17:54:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 471. [2025-02-05 17:54:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 399 states have (on average 1.4661654135338347) internal successors, (585), 406 states have internal predecessors, (585), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2025-02-05 17:54:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 682 transitions. [2025-02-05 17:54:48,850 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 682 transitions. Word has length 65 [2025-02-05 17:54:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:48,850 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 682 transitions. [2025-02-05 17:54:48,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-02-05 17:54:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 682 transitions. [2025-02-05 17:54:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:48,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:48,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:48,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:54:48,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1953158788, now seen corresponding path program 1 times [2025-02-05 17:54:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:48,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751775325] [2025-02-05 17:54:48,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:48,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:48,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:48,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:48,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751775325] [2025-02-05 17:54:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751775325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:49,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395020169] [2025-02-05 17:54:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:49,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:49,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:49,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:49,033 INFO L87 Difference]: Start difference. First operand 471 states and 682 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-02-05 17:54:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:49,690 INFO L93 Difference]: Finished difference Result 794 states and 1115 transitions. [2025-02-05 17:54:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2025-02-05 17:54:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:49,697 INFO L225 Difference]: With dead ends: 794 [2025-02-05 17:54:49,698 INFO L226 Difference]: Without dead ends: 613 [2025-02-05 17:54:49,699 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-02-05 17:54:49,704 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 806 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:49,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1449 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-05 17:54:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 569. [2025-02-05 17:54:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 477 states have (on average 1.4444444444444444) internal successors, (689), 486 states have internal predecessors, (689), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2025-02-05 17:54:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 816 transitions. [2025-02-05 17:54:49,764 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 816 transitions. Word has length 65 [2025-02-05 17:54:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:49,764 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 816 transitions. [2025-02-05 17:54:49,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-02-05 17:54:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 816 transitions. [2025-02-05 17:54:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:49,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:49,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:49,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:54:49,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1208617915, now seen corresponding path program 1 times [2025-02-05 17:54:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654784215] [2025-02-05 17:54:49,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:49,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:49,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:49,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:49,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654784215] [2025-02-05 17:54:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654784215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845511983] [2025-02-05 17:54:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:49,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:49,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:49,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:49,886 INFO L87 Difference]: Start difference. First operand 569 states and 816 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-02-05 17:54:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:49,935 INFO L93 Difference]: Finished difference Result 847 states and 1192 transitions. [2025-02-05 17:54:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:49,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2025-02-05 17:54:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:49,939 INFO L225 Difference]: With dead ends: 847 [2025-02-05 17:54:49,940 INFO L226 Difference]: Without dead ends: 574 [2025-02-05 17:54:49,941 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-02-05 17:54:49,942 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 0 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2730 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-02-05 17:54:49,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2730 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-02-05 17:54:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-02-05 17:54:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 481 states have (on average 1.4365904365904365) internal successors, (691), 490 states have internal predecessors, (691), 59 states have call successors, (59), 29 states have call predecessors, (59), 32 states have return successors, (69), 58 states have call predecessors, (69), 55 states have call successors, (69) [2025-02-05 17:54:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 819 transitions. [2025-02-05 17:54:49,991 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 819 transitions. Word has length 65 [2025-02-05 17:54:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:49,991 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 819 transitions. [2025-02-05 17:54:49,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-02-05 17:54:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 819 transitions. [2025-02-05 17:54:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:49,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:49,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:54:49,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:49,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash 424186084, now seen corresponding path program 1 times [2025-02-05 17:54:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:49,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748821218] [2025-02-05 17:54:49,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:50,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:50,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:50,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:50,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:50,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748821218] [2025-02-05 17:54:50,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748821218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:50,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:50,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:50,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927543961] [2025-02-05 17:54:50,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:50,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:50,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:50,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:50,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:50,069 INFO L87 Difference]: Start difference. First operand 574 states and 819 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:54:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:50,583 INFO L93 Difference]: Finished difference Result 2608 states and 3590 transitions. [2025-02-05 17:54:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:50,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-02-05 17:54:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:50,599 INFO L225 Difference]: With dead ends: 2608 [2025-02-05 17:54:50,600 INFO L226 Difference]: Without dead ends: 2330 [2025-02-05 17:54:50,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:54:50,603 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 1588 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:50,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 2350 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:54:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-02-05 17:54:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2170. [2025-02-05 17:54:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 1738 states have (on average 1.3440736478711162) internal successors, (2336), 1775 states have internal predecessors, (2336), 224 states have call successors, (224), 173 states have call predecessors, (224), 206 states have return successors, (338), 225 states have call predecessors, (338), 220 states have call successors, (338) [2025-02-05 17:54:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2898 transitions. [2025-02-05 17:54:50,802 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2898 transitions. Word has length 65 [2025-02-05 17:54:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:50,802 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 2898 transitions. [2025-02-05 17:54:50,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:54:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2898 transitions. [2025-02-05 17:54:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:50,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:50,803 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] [2025-02-05 17:54:50,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:54:50,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:50,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1228347126, now seen corresponding path program 1 times [2025-02-05 17:54:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227319640] [2025-02-05 17:54:50,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:50,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:50,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:50,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227319640] [2025-02-05 17:54:50,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227319640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:50,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:50,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210446432] [2025-02-05 17:54:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:50,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:50,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:50,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:50,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:50,876 INFO L87 Difference]: Start difference. First operand 2170 states and 2898 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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-02-05 17:54:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:51,038 INFO L93 Difference]: Finished difference Result 4089 states and 5458 transitions. [2025-02-05 17:54:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:51,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2025-02-05 17:54:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:51,051 INFO L225 Difference]: With dead ends: 4089 [2025-02-05 17:54:51,051 INFO L226 Difference]: Without dead ends: 2215 [2025-02-05 17:54:51,054 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-02-05 17:54:51,054 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 0 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2730 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-02-05 17:54:51,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2730 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2025-02-05 17:54:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2215. [2025-02-05 17:54:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1774 states have (on average 1.3286358511837655) internal successors, (2357), 1811 states have internal predecessors, (2357), 224 states have call successors, (224), 173 states have call predecessors, (224), 215 states have return successors, (356), 234 states have call predecessors, (356), 220 states have call successors, (356) [2025-02-05 17:54:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 2937 transitions. [2025-02-05 17:54:51,183 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 2937 transitions. Word has length 66 [2025-02-05 17:54:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:51,185 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 2937 transitions. [2025-02-05 17:54:51,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 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-02-05 17:54:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2937 transitions. [2025-02-05 17:54:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:51,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:51,188 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] [2025-02-05 17:54:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:54:51,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1217030999, now seen corresponding path program 1 times [2025-02-05 17:54:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649578724] [2025-02-05 17:54:51,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:51,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:51,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:51,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:51,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:51,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649578724] [2025-02-05 17:54:51,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649578724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:51,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256242373] [2025-02-05 17:54:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:51,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:51,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:51,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:51,328 INFO L87 Difference]: Start difference. First operand 2215 states and 2937 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-02-05 17:54:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:52,016 INFO L93 Difference]: Finished difference Result 3974 states and 5182 transitions. [2025-02-05 17:54:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:54:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2025-02-05 17:54:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:52,029 INFO L225 Difference]: With dead ends: 3974 [2025-02-05 17:54:52,029 INFO L226 Difference]: Without dead ends: 2417 [2025-02-05 17:54:52,033 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-02-05 17:54:52,034 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 796 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:52,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1235 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2025-02-05 17:54:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2225. [2025-02-05 17:54:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1786 states have (on average 1.322508398656215) internal successors, (2362), 1818 states have internal predecessors, (2362), 225 states have call successors, (225), 174 states have call predecessors, (225), 212 states have return successors, (340), 236 states have call predecessors, (340), 221 states have call successors, (340) [2025-02-05 17:54:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2927 transitions. [2025-02-05 17:54:52,140 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2927 transitions. Word has length 66 [2025-02-05 17:54:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:52,141 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 2927 transitions. [2025-02-05 17:54:52,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-02-05 17:54:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2927 transitions. [2025-02-05 17:54:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:52,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:52,142 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] [2025-02-05 17:54:52,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:54:52,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:52,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1000726954, now seen corresponding path program 1 times [2025-02-05 17:54:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:52,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987888537] [2025-02-05 17:54:52,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:52,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:52,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:52,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:52,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987888537] [2025-02-05 17:54:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987888537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:54:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617695348] [2025-02-05 17:54:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:52,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:54:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:52,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:54:52,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:54:52,203 INFO L87 Difference]: Start difference. First operand 2225 states and 2927 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-02-05 17:54:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:52,709 INFO L93 Difference]: Finished difference Result 5770 states and 7542 transitions. [2025-02-05 17:54:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:54:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 66 [2025-02-05 17:54:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:52,726 INFO L225 Difference]: With dead ends: 5770 [2025-02-05 17:54:52,727 INFO L226 Difference]: Without dead ends: 3844 [2025-02-05 17:54:52,732 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-02-05 17:54:52,732 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 750 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:52,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 622 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2025-02-05 17:54:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3840. [2025-02-05 17:54:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3045 states have (on average 1.283743842364532) internal successors, (3909), 3101 states have internal predecessors, (3909), 394 states have call successors, (394), 319 states have call predecessors, (394), 399 states have return successors, (672), 423 states have call predecessors, (672), 390 states have call successors, (672) [2025-02-05 17:54:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 4975 transitions. [2025-02-05 17:54:53,012 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 4975 transitions. Word has length 66 [2025-02-05 17:54:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:53,013 INFO L471 AbstractCegarLoop]: Abstraction has 3840 states and 4975 transitions. [2025-02-05 17:54:53,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-02-05 17:54:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 4975 transitions. [2025-02-05 17:54:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:54:53,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:53,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:53,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:54:53,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:53,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 766398524, now seen corresponding path program 1 times [2025-02-05 17:54:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:53,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884043781] [2025-02-05 17:54:53,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:53,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:54:53,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:54:53,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:53,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884043781] [2025-02-05 17:54:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884043781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:53,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:53,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:53,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398900602] [2025-02-05 17:54:53,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:53,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:53,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:53,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:53,051 INFO L87 Difference]: Start difference. First operand 3840 states and 4975 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-05 17:54:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:53,110 INFO L93 Difference]: Finished difference Result 4328 states and 5585 transitions. [2025-02-05 17:54:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:53,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2025-02-05 17:54:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:53,118 INFO L225 Difference]: With dead ends: 4328 [2025-02-05 17:54:53,118 INFO L226 Difference]: Without dead ends: 736 [2025-02-05 17:54:53,125 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-02-05 17:54:53,125 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 92 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:53,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 950 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-02-05 17:54:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 728. [2025-02-05 17:54:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 591 states have (on average 1.3231810490693738) internal successors, (782), 600 states have internal predecessors, (782), 80 states have call successors, (80), 50 states have call predecessors, (80), 55 states have return successors, (89), 81 states have call predecessors, (89), 76 states have call successors, (89) [2025-02-05 17:54:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 951 transitions. [2025-02-05 17:54:53,161 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 951 transitions. Word has length 67 [2025-02-05 17:54:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:53,161 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 951 transitions. [2025-02-05 17:54:53,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-05 17:54:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 951 transitions. [2025-02-05 17:54:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:54:53,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:53,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:53,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:54:53,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1368811182, now seen corresponding path program 1 times [2025-02-05 17:54:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419312472] [2025-02-05 17:54:53,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:53,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:54:53,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:54:53,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:53,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:54:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419312472] [2025-02-05 17:54:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419312472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:53,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:53,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372793438] [2025-02-05 17:54:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:53,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:53,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:53,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:53,257 INFO L87 Difference]: Start difference. First operand 728 states and 951 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-02-05 17:54:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:53,946 INFO L93 Difference]: Finished difference Result 1602 states and 1958 transitions. [2025-02-05 17:54:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 17:54:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 84 [2025-02-05 17:54:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:53,951 INFO L225 Difference]: With dead ends: 1602 [2025-02-05 17:54:53,951 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 17:54:53,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:54:53,953 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 529 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:53,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1549 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 17:54:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 944. [2025-02-05 17:54:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 757 states have (on average 1.274768824306473) internal successors, (965), 768 states have internal predecessors, (965), 104 states have call successors, (104), 71 states have call predecessors, (104), 81 states have return successors, (120), 108 states have call predecessors, (120), 100 states have call successors, (120) [2025-02-05 17:54:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1189 transitions. [2025-02-05 17:54:53,993 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1189 transitions. Word has length 84 [2025-02-05 17:54:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:53,994 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1189 transitions. [2025-02-05 17:54:53,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-02-05 17:54:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1189 transitions. [2025-02-05 17:54:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:54:53,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:53,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:53,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:54:53,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:53,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1791399911, now seen corresponding path program 1 times [2025-02-05 17:54:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039510536] [2025-02-05 17:54:53,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:54,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:54:54,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:54:54,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:54,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:54,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:54,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039510536] [2025-02-05 17:54:54,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039510536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:54,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:54,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:54,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479422982] [2025-02-05 17:54:54,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:54,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:54,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:54,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:54,032 INFO L87 Difference]: Start difference. First operand 944 states and 1189 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:54,062 INFO L93 Difference]: Finished difference Result 1207 states and 1587 transitions. [2025-02-05 17:54:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:54,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2025-02-05 17:54:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:54,067 INFO L225 Difference]: With dead ends: 1207 [2025-02-05 17:54:54,067 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 17:54:54,068 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-02-05 17:54:54,068 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 406 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:54,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 636 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 17:54:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2025-02-05 17:54:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 757 states have (on average 1.273447820343461) internal successors, (964), 768 states have internal predecessors, (964), 104 states have call successors, (104), 71 states have call predecessors, (104), 81 states have return successors, (120), 108 states have call predecessors, (120), 100 states have call successors, (120) [2025-02-05 17:54:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1188 transitions. [2025-02-05 17:54:54,118 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1188 transitions. Word has length 124 [2025-02-05 17:54:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:54,118 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1188 transitions. [2025-02-05 17:54:54,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1188 transitions. [2025-02-05 17:54:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:54:54,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:54,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:54,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:54:54,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:54,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1421759098, now seen corresponding path program 1 times [2025-02-05 17:54:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:54,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872740278] [2025-02-05 17:54:54,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:54,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:54,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:54:54,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:54:54,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:54,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:54,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872740278] [2025-02-05 17:54:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872740278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:54,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:54,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349845121] [2025-02-05 17:54:54,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:54,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:54,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:54,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:54,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:54,201 INFO L87 Difference]: Start difference. First operand 944 states and 1188 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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-02-05 17:54:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:54,640 INFO L93 Difference]: Finished difference Result 1492 states and 2032 transitions. [2025-02-05 17:54:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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 124 [2025-02-05 17:54:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:54,646 INFO L225 Difference]: With dead ends: 1492 [2025-02-05 17:54:54,646 INFO L226 Difference]: Without dead ends: 1232 [2025-02-05 17:54:54,647 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-02-05 17:54:54,648 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 893 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:54,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1301 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-02-05 17:54:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1211. [2025-02-05 17:54:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1001 states have (on average 1.3396603396603397) internal successors, (1341), 1013 states have internal predecessors, (1341), 120 states have call successors, (120), 77 states have call predecessors, (120), 88 states have return successors, (137), 124 states have call predecessors, (137), 116 states have call successors, (137) [2025-02-05 17:54:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1598 transitions. [2025-02-05 17:54:54,697 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1598 transitions. Word has length 124 [2025-02-05 17:54:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:54,697 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1598 transitions. [2025-02-05 17:54:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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-02-05 17:54:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1598 transitions. [2025-02-05 17:54:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:54:54,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:54,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:54,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:54:54,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 912934904, now seen corresponding path program 1 times [2025-02-05 17:54:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:54,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712642203] [2025-02-05 17:54:54,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:54,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:54:54,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:54:54,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:54,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712642203] [2025-02-05 17:54:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712642203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:54,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:54,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271220238] [2025-02-05 17:54:54,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:54,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:54,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:54,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:54,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:54,838 INFO L87 Difference]: Start difference. First operand 1211 states and 1598 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:55,478 INFO L93 Difference]: Finished difference Result 2073 states and 2937 transitions. [2025-02-05 17:54:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:54:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:55,489 INFO L225 Difference]: With dead ends: 2073 [2025-02-05 17:54:55,489 INFO L226 Difference]: Without dead ends: 1546 [2025-02-05 17:54:55,491 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-02-05 17:54:55,492 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 892 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:55,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2434 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-02-05 17:54:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1461. [2025-02-05 17:54:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1228 states have (on average 1.3713355048859934) internal successors, (1684), 1241 states have internal predecessors, (1684), 136 states have call successors, (136), 83 states have call predecessors, (136), 95 states have return successors, (156), 141 states have call predecessors, (156), 132 states have call successors, (156) [2025-02-05 17:54:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1976 transitions. [2025-02-05 17:54:55,564 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1976 transitions. Word has length 124 [2025-02-05 17:54:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:55,565 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1976 transitions. [2025-02-05 17:54:55,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1976 transitions. [2025-02-05 17:54:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:54:55,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:55,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:54:55,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:55,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 972155641, now seen corresponding path program 1 times [2025-02-05 17:54:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484026189] [2025-02-05 17:54:55,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:55,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:54:55,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:54:55,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:55,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484026189] [2025-02-05 17:54:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484026189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:55,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:55,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326268966] [2025-02-05 17:54:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:55,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:55,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:55,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:55,689 INFO L87 Difference]: Start difference. First operand 1461 states and 1976 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:56,456 INFO L93 Difference]: Finished difference Result 2863 states and 4150 transitions. [2025-02-05 17:54:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:56,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:54:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:56,467 INFO L225 Difference]: With dead ends: 2863 [2025-02-05 17:54:56,467 INFO L226 Difference]: Without dead ends: 2086 [2025-02-05 17:54:56,470 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-02-05 17:54:56,471 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 887 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:56,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2418 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2025-02-05 17:54:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1990. [2025-02-05 17:54:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1709 states have (on average 1.416617905207724) internal successors, (2421), 1726 states have internal predecessors, (2421), 168 states have call successors, (168), 95 states have call predecessors, (168), 111 states have return successors, (200), 175 states have call predecessors, (200), 164 states have call successors, (200) [2025-02-05 17:54:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2789 transitions. [2025-02-05 17:54:56,570 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2789 transitions. Word has length 124 [2025-02-05 17:54:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:56,570 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2789 transitions. [2025-02-05 17:54:56,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2789 transitions. [2025-02-05 17:54:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:54:56,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:56,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:56,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:54:56,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:56,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1666802648, now seen corresponding path program 1 times [2025-02-05 17:54:56,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:56,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541053719] [2025-02-05 17:54:56,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:56,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:54:56,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:54:56,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:56,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541053719] [2025-02-05 17:54:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541053719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532096106] [2025-02-05 17:54:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:56,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:56,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:56,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:56,688 INFO L87 Difference]: Start difference. First operand 1990 states and 2789 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:57,364 INFO L93 Difference]: Finished difference Result 4554 states and 6801 transitions. [2025-02-05 17:54:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:57,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:54:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:57,377 INFO L225 Difference]: With dead ends: 4554 [2025-02-05 17:54:57,377 INFO L226 Difference]: Without dead ends: 3248 [2025-02-05 17:54:57,381 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-02-05 17:54:57,382 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 882 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:57,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2406 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2025-02-05 17:54:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3129. [2025-02-05 17:54:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3129 states, 2746 states have (on average 1.4701383831026948) internal successors, (4037), 2777 states have internal predecessors, (4037), 232 states have call successors, (232), 119 states have call predecessors, (232), 149 states have return successors, (312), 243 states have call predecessors, (312), 228 states have call successors, (312) [2025-02-05 17:54:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4581 transitions. [2025-02-05 17:54:57,501 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4581 transitions. Word has length 124 [2025-02-05 17:54:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:57,501 INFO L471 AbstractCegarLoop]: Abstraction has 3129 states and 4581 transitions. [2025-02-05 17:54:57,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4581 transitions. [2025-02-05 17:54:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:54:57,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:57,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:57,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:54:57,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:57,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1497378023, now seen corresponding path program 1 times [2025-02-05 17:54:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:57,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146320958] [2025-02-05 17:54:57,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:57,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:54:57,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:54:57,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:57,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146320958] [2025-02-05 17:54:57,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146320958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:57,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:57,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691206499] [2025-02-05 17:54:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:57,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:57,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:57,642 INFO L87 Difference]: Start difference. First operand 3129 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:58,395 INFO L93 Difference]: Finished difference Result 8241 states and 12755 transitions. [2025-02-05 17:54:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:54:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:58,422 INFO L225 Difference]: With dead ends: 8241 [2025-02-05 17:54:58,422 INFO L226 Difference]: Without dead ends: 5796 [2025-02-05 17:54:58,432 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-02-05 17:54:58,433 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 877 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:58,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 2394 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5796 states. [2025-02-05 17:54:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5796 to 5632. [2025-02-05 17:54:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5632 states, 5027 states have (on average 1.5239705589814998) internal successors, (7661), 5104 states have internal predecessors, (7661), 360 states have call successors, (360), 167 states have call predecessors, (360), 243 states have return successors, (632), 379 states have call predecessors, (632), 356 states have call successors, (632) [2025-02-05 17:54:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 8653 transitions. [2025-02-05 17:54:58,666 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 8653 transitions. Word has length 124 [2025-02-05 17:54:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:58,667 INFO L471 AbstractCegarLoop]: Abstraction has 5632 states and 8653 transitions. [2025-02-05 17:54:58,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 8653 transitions. [2025-02-05 17:54:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:54:58,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:58,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:58,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:54:58,672 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:58,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1864234936, now seen corresponding path program 1 times [2025-02-05 17:54:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731174567] [2025-02-05 17:54:58,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:58,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:54:58,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:54:58,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:58,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731174567] [2025-02-05 17:54:58,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731174567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:58,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:58,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:58,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126635255] [2025-02-05 17:54:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:58,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:58,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:58,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:58,781 INFO L87 Difference]: Start difference. First operand 5632 states and 8653 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:54:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:59,709 INFO L93 Difference]: Finished difference Result 16456 states and 26597 transitions. [2025-02-05 17:54:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:59,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:54:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:59,756 INFO L225 Difference]: With dead ends: 16456 [2025-02-05 17:54:59,756 INFO L226 Difference]: Without dead ends: 11508 [2025-02-05 17:54:59,768 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-02-05 17:54:59,769 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 872 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:59,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 2382 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11508 states. [2025-02-05 17:55:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11508 to 11259. [2025-02-05 17:55:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11259 states, 10156 states have (on average 1.5735525797558094) internal successors, (15981), 10379 states have internal predecessors, (15981), 616 states have call successors, (616), 263 states have call predecessors, (616), 485 states have return successors, (1656), 651 states have call predecessors, (1656), 612 states have call successors, (1656) [2025-02-05 17:55:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11259 states to 11259 states and 18253 transitions. [2025-02-05 17:55:00,201 INFO L78 Accepts]: Start accepts. Automaton has 11259 states and 18253 transitions. Word has length 124 [2025-02-05 17:55:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:00,202 INFO L471 AbstractCegarLoop]: Abstraction has 11259 states and 18253 transitions. [2025-02-05 17:55:00,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:55:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 11259 states and 18253 transitions. [2025-02-05 17:55:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:55:00,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:00,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:00,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:55:00,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:00,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:00,210 INFO L85 PathProgramCache]: Analyzing trace with hash -936819911, now seen corresponding path program 1 times [2025-02-05 17:55:00,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:00,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428308862] [2025-02-05 17:55:00,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:00,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:00,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:55:00,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:55:00,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:00,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:00,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428308862] [2025-02-05 17:55:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428308862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:00,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:00,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631258645] [2025-02-05 17:55:00,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:00,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:00,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:00,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:00,306 INFO L87 Difference]: Start difference. First operand 11259 states and 18253 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:55:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:01,633 INFO L93 Difference]: Finished difference Result 35195 states and 60147 transitions. [2025-02-05 17:55:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:55:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:01,736 INFO L225 Difference]: With dead ends: 35195 [2025-02-05 17:55:01,736 INFO L226 Difference]: Without dead ends: 24620 [2025-02-05 17:55:01,772 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-02-05 17:55:01,772 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 867 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:01,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 2370 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24620 states. [2025-02-05 17:55:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24620 to 24214. [2025-02-05 17:55:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24214 states, 21953 states have (on average 1.61804764724639) internal successors, (35521), 22630 states have internal predecessors, (35521), 1128 states have call successors, (1128), 455 states have call predecessors, (1128), 1131 states have return successors, (5240), 1195 states have call predecessors, (5240), 1124 states have call successors, (5240) [2025-02-05 17:55:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24214 states to 24214 states and 41889 transitions. [2025-02-05 17:55:02,767 INFO L78 Accepts]: Start accepts. Automaton has 24214 states and 41889 transitions. Word has length 124 [2025-02-05 17:55:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:02,768 INFO L471 AbstractCegarLoop]: Abstraction has 24214 states and 41889 transitions. [2025-02-05 17:55:02,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:55:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 24214 states and 41889 transitions. [2025-02-05 17:55:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:55:02,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:02,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:02,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:55:02,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:02,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2135555176, now seen corresponding path program 1 times [2025-02-05 17:55:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:02,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743147798] [2025-02-05 17:55:02,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:02,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:02,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:55:02,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:55:02,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:02,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743147798] [2025-02-05 17:55:02,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743147798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:02,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:02,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:02,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438780873] [2025-02-05 17:55:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:02,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:02,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:02,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:02,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:02,873 INFO L87 Difference]: Start difference. First operand 24214 states and 41889 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:55:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:05,412 INFO L93 Difference]: Finished difference Result 78962 states and 145513 transitions. [2025-02-05 17:55:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:05,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:55:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:05,664 INFO L225 Difference]: With dead ends: 78962 [2025-02-05 17:55:05,664 INFO L226 Difference]: Without dead ends: 55432 [2025-02-05 17:55:05,743 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-02-05 17:55:05,744 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 862 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:05,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 2358 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55432 states. [2025-02-05 17:55:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55432 to 54741. [2025-02-05 17:55:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54741 states, 49678 states have (on average 1.6575747815934618) internal successors, (82345), 51749 states have internal predecessors, (82345), 2152 states have call successors, (2152), 839 states have call predecessors, (2152), 2909 states have return successors, (18552), 2283 states have call predecessors, (18552), 2148 states have call successors, (18552) [2025-02-05 17:55:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54741 states to 54741 states and 103049 transitions. [2025-02-05 17:55:08,287 INFO L78 Accepts]: Start accepts. Automaton has 54741 states and 103049 transitions. Word has length 124 [2025-02-05 17:55:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:08,288 INFO L471 AbstractCegarLoop]: Abstraction has 54741 states and 103049 transitions. [2025-02-05 17:55:08,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:55:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 54741 states and 103049 transitions. [2025-02-05 17:55:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:55:08,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:08,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:55:08,306 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:08,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1620034727, now seen corresponding path program 1 times [2025-02-05 17:55:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171749527] [2025-02-05 17:55:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:08,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:55:08,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:55:08,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:08,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:08,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171749527] [2025-02-05 17:55:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171749527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:08,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:08,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050674311] [2025-02-05 17:55:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:08,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:08,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:08,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:08,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:08,381 INFO L87 Difference]: Start difference. First operand 54741 states and 103049 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:55:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:13,407 INFO L93 Difference]: Finished difference Result 190357 states and 385432 transitions. [2025-02-05 17:55:13,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:13,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2025-02-05 17:55:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:14,121 INFO L225 Difference]: With dead ends: 190357 [2025-02-05 17:55:14,121 INFO L226 Difference]: Without dead ends: 136300 [2025-02-05 17:55:14,294 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-02-05 17:55:14,295 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1081 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:14,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 2333 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136300 states. [2025-02-05 17:55:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136300 to 127804. [2025-02-05 17:55:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127804 states, 115807 states have (on average 1.69320507395926) internal successors, (196085), 122124 states have internal predecessors, (196085), 4072 states have call successors, (4072), 1607 states have call predecessors, (4072), 7923 states have return successors, (69624), 4331 states have call predecessors, (69624), 4068 states have call successors, (69624) [2025-02-05 17:55:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127804 states to 127804 states and 269781 transitions. [2025-02-05 17:55:21,117 INFO L78 Accepts]: Start accepts. Automaton has 127804 states and 269781 transitions. Word has length 124 [2025-02-05 17:55:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:21,118 INFO L471 AbstractCegarLoop]: Abstraction has 127804 states and 269781 transitions. [2025-02-05 17:55:21,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:55:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 127804 states and 269781 transitions. [2025-02-05 17:55:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 17:55:21,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:21,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:55:21,151 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1721730936, now seen corresponding path program 1 times [2025-02-05 17:55:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680008291] [2025-02-05 17:55:21,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:21,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 17:55:21,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 17:55:21,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:21,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680008291] [2025-02-05 17:55:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680008291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:21,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:21,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930347578] [2025-02-05 17:55:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:21,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:21,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:21,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:21,405 INFO L87 Difference]: Start difference. First operand 127804 states and 269781 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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)