./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:05:01,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:05:01,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:05:01,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:05:01,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:05:01,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:05:01,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:05:01,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:05:01,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:05:01,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:05:01,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:05:01,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:05:01,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:05:01,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:05:01,649 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:05:01,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:05:01,650 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:05:01,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:01,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:05:01,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:01,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:05:01,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:05:01,653 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 -> 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f [2025-01-09 06:05:01,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:05:01,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:05:01,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:05:01,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:05:01,860 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:05:01,861 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.10.cil-1.c [2025-01-09 06:05:03,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc6176b18/8f7ecf86c6224b9d96f32c0b2a0c76fd/FLAGdf5138133 [2025-01-09 06:05:03,757 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:05:03,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2025-01-09 06:05:03,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc6176b18/8f7ecf86c6224b9d96f32c0b2a0c76fd/FLAGdf5138133 [2025-01-09 06:05:03,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc6176b18/8f7ecf86c6224b9d96f32c0b2a0c76fd [2025-01-09 06:05:03,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:05:03,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:05:03,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:05:03,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:05:03,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:05:03,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:03" (1/1) ... [2025-01-09 06:05:03,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32225ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:03, skipping insertion in model container [2025-01-09 06:05:03,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:03" (1/1) ... [2025-01-09 06:05:03,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:05:04,011 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.10.cil-1.c[914,927] [2025-01-09 06:05:04,069 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.10.cil-1.c[7115,7128] [2025-01-09 06:05:04,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:05:04,153 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:05:04,160 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.10.cil-1.c[914,927] [2025-01-09 06:05:04,171 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.10.cil-1.c[7115,7128] [2025-01-09 06:05:04,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:05:04,222 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:05:04,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04 WrapperNode [2025-01-09 06:05:04,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:05:04,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:05:04,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:05:04,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:05:04,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,265 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 903 [2025-01-09 06:05:04,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:05:04,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:05:04,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:05:04,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:05:04,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,289 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 06:05:04,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:05:04,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:05:04,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:05:04,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:05:04,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (1/1) ... [2025-01-09 06:05:04,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:04,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:04,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:05:04,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:05:04,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:05:04,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:05:04,368 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:05:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:05:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:05:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:05:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:05:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:05:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:05:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:05:04,370 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:05:04,556 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:05:04,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:05:06,135 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-01-09 06:05:06,135 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:05:06,170 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:05:06,173 INFO L312 CfgBuilder]: Removed 17 assume(true) statements. [2025-01-09 06:05:06,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:06 BoogieIcfgContainer [2025-01-09 06:05:06,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:05:06,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:05:06,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:05:06,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:05:06,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:05:03" (1/3) ... [2025-01-09 06:05:06,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc8a2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:06, skipping insertion in model container [2025-01-09 06:05:06,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:04" (2/3) ... [2025-01-09 06:05:06,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc8a2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:06, skipping insertion in model container [2025-01-09 06:05:06,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:06" (3/3) ... [2025-01-09 06:05:06,190 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2025-01-09 06:05:06,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:05:06,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c that has 16 procedures, 435 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-01-09 06:05:06,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:05:06,328 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;@29d72496, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:05:06,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:05:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 435 states, 379 states have (on average 1.5936675461741425) internal successors, (604), 385 states have internal predecessors, (604), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 06:05:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:06,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:06,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:06,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:06,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash -640880113, now seen corresponding path program 1 times [2025-01-09 06:05:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769869766] [2025-01-09 06:05:06,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:06,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:06,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:06,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:06,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:06,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:06,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:06,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769869766] [2025-01-09 06:05:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769869766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:06,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:06,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146681056] [2025-01-09 06:05:06,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:06,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:06,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:06,795 INFO L87 Difference]: Start difference. First operand has 435 states, 379 states have (on average 1.5936675461741425) internal successors, (604), 385 states have internal predecessors, (604), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:07,830 INFO L93 Difference]: Finished difference Result 942 states and 1476 transitions. [2025-01-09 06:05:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:07,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:05:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:07,841 INFO L225 Difference]: With dead ends: 942 [2025-01-09 06:05:07,842 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 06:05:07,846 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-01-09 06:05:07,848 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 437 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:07,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1394 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:05:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 06:05:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 516. [2025-01-09 06:05:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 441 states have (on average 1.5328798185941044) internal successors, (676), 448 states have internal predecessors, (676), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2025-01-09 06:05:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 779 transitions. [2025-01-09 06:05:07,929 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 779 transitions. Word has length 62 [2025-01-09 06:05:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:07,929 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 779 transitions. [2025-01-09 06:05:07,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 779 transitions. [2025-01-09 06:05:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:07,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:07,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:07,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:05:07,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:07,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -437544113, now seen corresponding path program 1 times [2025-01-09 06:05:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957342886] [2025-01-09 06:05:07,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:07,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:07,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:07,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:07,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957342886] [2025-01-09 06:05:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957342886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:08,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:08,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806852213] [2025-01-09 06:05:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:08,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:08,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:08,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:08,110 INFO L87 Difference]: Start difference. First operand 516 states and 779 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:08,886 INFO L93 Difference]: Finished difference Result 821 states and 1198 transitions. [2025-01-09 06:05:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:08,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:05:08,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:08,891 INFO L225 Difference]: With dead ends: 821 [2025-01-09 06:05:08,891 INFO L226 Difference]: Without dead ends: 652 [2025-01-09 06:05:08,892 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-01-09 06:05:08,893 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 935 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:08,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1568 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-09 06:05:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 608. [2025-01-09 06:05:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 513 states have (on average 1.5126705653021442) internal successors, (776), 522 states have internal predecessors, (776), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2025-01-09 06:05:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 909 transitions. [2025-01-09 06:05:08,943 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 909 transitions. Word has length 62 [2025-01-09 06:05:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:08,944 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 909 transitions. [2025-01-09 06:05:08,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 909 transitions. [2025-01-09 06:05:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:08,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:08,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:08,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:05:08,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1501617933, now seen corresponding path program 1 times [2025-01-09 06:05:08,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:08,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900618998] [2025-01-09 06:05:08,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:08,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:08,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:08,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:08,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:08,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900618998] [2025-01-09 06:05:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900618998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:09,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:09,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42687409] [2025-01-09 06:05:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:09,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:09,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:09,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:09,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:09,112 INFO L87 Difference]: Start difference. First operand 608 states and 909 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:09,168 INFO L93 Difference]: Finished difference Result 868 states and 1270 transitions. [2025-01-09 06:05:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-01-09 06:05:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:09,175 INFO L225 Difference]: With dead ends: 868 [2025-01-09 06:05:09,175 INFO L226 Difference]: Without dead ends: 613 [2025-01-09 06:05:09,176 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-01-09 06:05:09,177 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 0 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3235 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-01-09 06:05:09,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3235 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-01-09 06:05:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2025-01-09 06:05:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 517 states have (on average 1.504835589941973) internal successors, (778), 526 states have internal predecessors, (778), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2025-01-09 06:05:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 912 transitions. [2025-01-09 06:05:09,226 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 912 transitions. Word has length 62 [2025-01-09 06:05:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:09,227 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 912 transitions. [2025-01-09 06:05:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 912 transitions. [2025-01-09 06:05:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:09,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:09,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:09,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:05:09,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:09,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash 657612431, now seen corresponding path program 1 times [2025-01-09 06:05:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:09,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627190686] [2025-01-09 06:05:09,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:09,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:09,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:09,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:09,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:09,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627190686] [2025-01-09 06:05:09,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627190686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:09,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:09,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976874615] [2025-01-09 06:05:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:09,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:09,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:09,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:09,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:09,353 INFO L87 Difference]: Start difference. First operand 613 states and 912 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:09,413 INFO L93 Difference]: Finished difference Result 888 states and 1288 transitions. [2025-01-09 06:05:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:09,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-01-09 06:05:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:09,419 INFO L225 Difference]: With dead ends: 888 [2025-01-09 06:05:09,419 INFO L226 Difference]: Without dead ends: 628 [2025-01-09 06:05:09,421 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-01-09 06:05:09,424 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 0 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3235 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-01-09 06:05:09,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3235 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-09 06:05:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2025-01-09 06:05:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 529 states have (on average 1.4933837429111532) internal successors, (790), 538 states have internal predecessors, (790), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2025-01-09 06:05:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2025-01-09 06:05:09,476 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 62 [2025-01-09 06:05:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:09,477 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2025-01-09 06:05:09,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2025-01-09 06:05:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:09,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:09,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:05:09,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 719652045, now seen corresponding path program 1 times [2025-01-09 06:05:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130402007] [2025-01-09 06:05:09,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:09,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:09,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:09,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:09,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130402007] [2025-01-09 06:05:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130402007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:09,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126423940] [2025-01-09 06:05:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:09,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:09,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:09,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:09,687 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:10,447 INFO L93 Difference]: Finished difference Result 987 states and 1396 transitions. [2025-01-09 06:05:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:05:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:05:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:10,456 INFO L225 Difference]: With dead ends: 987 [2025-01-09 06:05:10,456 INFO L226 Difference]: Without dead ends: 714 [2025-01-09 06:05:10,457 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-01-09 06:05:10,458 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 949 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:10,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1415 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-01-09 06:05:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 640. [2025-01-09 06:05:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 539 states have (on average 1.484230055658627) internal successors, (800), 548 states have internal predecessors, (800), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2025-01-09 06:05:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 937 transitions. [2025-01-09 06:05:10,500 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 937 transitions. Word has length 62 [2025-01-09 06:05:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:10,501 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 937 transitions. [2025-01-09 06:05:10,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 937 transitions. [2025-01-09 06:05:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:10,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:10,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:10,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:05:10,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:10,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1142353871, now seen corresponding path program 1 times [2025-01-09 06:05:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575940545] [2025-01-09 06:05:10,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:10,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:10,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:10,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:10,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575940545] [2025-01-09 06:05:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575940545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:10,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:05:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324695996] [2025-01-09 06:05:10,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:10,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:05:10,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:10,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:05:10,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:05:10,572 INFO L87 Difference]: Start difference. First operand 640 states and 937 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:10,964 INFO L93 Difference]: Finished difference Result 1209 states and 1692 transitions. [2025-01-09 06:05:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:05:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:05:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:10,969 INFO L225 Difference]: With dead ends: 1209 [2025-01-09 06:05:10,969 INFO L226 Difference]: Without dead ends: 925 [2025-01-09 06:05:10,970 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-01-09 06:05:10,971 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 911 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:10,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 704 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-01-09 06:05:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2025-01-09 06:05:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 754 states have (on average 1.429708222811671) internal successors, (1078), 770 states have internal predecessors, (1078), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2025-01-09 06:05:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1307 transitions. [2025-01-09 06:05:11,040 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1307 transitions. Word has length 62 [2025-01-09 06:05:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:11,040 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1307 transitions. [2025-01-09 06:05:11,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1307 transitions. [2025-01-09 06:05:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:05:11,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:11,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:11,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:05:11,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:11,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash -710966107, now seen corresponding path program 1 times [2025-01-09 06:05:11,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:11,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997379799] [2025-01-09 06:05:11,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:11,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:11,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:05:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:05:11,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:11,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997379799] [2025-01-09 06:05:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997379799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:11,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:11,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434408184] [2025-01-09 06:05:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:11,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:11,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:11,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:11,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:11,098 INFO L87 Difference]: Start difference. First operand 921 states and 1307 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:11,167 INFO L93 Difference]: Finished difference Result 1990 states and 2724 transitions. [2025-01-09 06:05:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-01-09 06:05:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:11,176 INFO L225 Difference]: With dead ends: 1990 [2025-01-09 06:05:11,176 INFO L226 Difference]: Without dead ends: 1404 [2025-01-09 06:05:11,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:11,179 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 102 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:11,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1263 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-01-09 06:05:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1381. [2025-01-09 06:05:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1112 states have (on average 1.3830935251798562) internal successors, (1538), 1131 states have internal predecessors, (1538), 143 states have call successors, (143), 96 states have call predecessors, (143), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2025-01-09 06:05:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1884 transitions. [2025-01-09 06:05:11,251 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1884 transitions. Word has length 63 [2025-01-09 06:05:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:11,253 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1884 transitions. [2025-01-09 06:05:11,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1884 transitions. [2025-01-09 06:05:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:05:11,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:11,255 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] [2025-01-09 06:05:11,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:05:11,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:11,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash 832685518, now seen corresponding path program 1 times [2025-01-09 06:05:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967047147] [2025-01-09 06:05:11,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:11,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:11,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:05:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:05:11,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:11,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:11,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-01-09 06:05:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967047147] [2025-01-09 06:05:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967047147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:11,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470066725] [2025-01-09 06:05:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:11,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:11,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:11,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:11,308 INFO L87 Difference]: Start difference. First operand 1381 states and 1884 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-09 06:05:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:11,483 INFO L93 Difference]: Finished difference Result 3325 states and 4417 transitions. [2025-01-09 06:05:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:11,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 64 [2025-01-09 06:05:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:11,507 INFO L225 Difference]: With dead ends: 3325 [2025-01-09 06:05:11,507 INFO L226 Difference]: Without dead ends: 2299 [2025-01-09 06:05:11,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:11,514 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 622 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:11,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 753 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2025-01-09 06:05:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2213. [2025-01-09 06:05:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1748 states have (on average 1.335812356979405) internal successors, (2335), 1777 states have internal predecessors, (2335), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2025-01-09 06:05:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2915 transitions. [2025-01-09 06:05:11,772 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2915 transitions. Word has length 64 [2025-01-09 06:05:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:11,777 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 2915 transitions. [2025-01-09 06:05:11,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-09 06:05:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2915 transitions. [2025-01-09 06:05:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:05:11,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:11,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:11,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:05:11,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:11,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1838770839, now seen corresponding path program 1 times [2025-01-09 06:05:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:11,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052343278] [2025-01-09 06:05:11,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:11,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:05:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:05:11,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:11,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052343278] [2025-01-09 06:05:11,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052343278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:11,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:11,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:11,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744688387] [2025-01-09 06:05:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:11,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:11,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:11,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:11,858 INFO L87 Difference]: Start difference. First operand 2213 states and 2915 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-01-09 06:05:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:12,192 INFO L93 Difference]: Finished difference Result 4806 states and 6220 transitions. [2025-01-09 06:05:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 68 [2025-01-09 06:05:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:12,217 INFO L225 Difference]: With dead ends: 4806 [2025-01-09 06:05:12,220 INFO L226 Difference]: Without dead ends: 2948 [2025-01-09 06:05:12,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:12,233 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 622 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:12,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 768 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2025-01-09 06:05:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2919. [2025-01-09 06:05:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2290 states have (on average 1.3157205240174672) internal successors, (3013), 2327 states have internal predecessors, (3013), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2025-01-09 06:05:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3782 transitions. [2025-01-09 06:05:12,561 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3782 transitions. Word has length 68 [2025-01-09 06:05:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:12,565 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 3782 transitions. [2025-01-09 06:05:12,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-01-09 06:05:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3782 transitions. [2025-01-09 06:05:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:05:12,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:12,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:12,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:05:12,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:12,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash 297027803, now seen corresponding path program 1 times [2025-01-09 06:05:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:12,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928609966] [2025-01-09 06:05:12,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:12,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:05:12,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:05:12,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:12,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928609966] [2025-01-09 06:05:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928609966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:05:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450682620] [2025-01-09 06:05:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:05:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:12,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:05:12,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:05:12,742 INFO L87 Difference]: Start difference. First operand 2919 states and 3782 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:13,259 INFO L93 Difference]: Finished difference Result 3427 states and 4414 transitions. [2025-01-09 06:05:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-01-09 06:05:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:13,292 INFO L225 Difference]: With dead ends: 3427 [2025-01-09 06:05:13,292 INFO L226 Difference]: Without dead ends: 3424 [2025-01-09 06:05:13,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:13,298 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 1213 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:13,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 747 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2025-01-09 06:05:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3395. [2025-01-09 06:05:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3395 states, 2657 states have (on average 1.304855099736545) internal successors, (3467), 2699 states have internal predecessors, (3467), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2025-01-09 06:05:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 4365 transitions. [2025-01-09 06:05:13,699 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 4365 transitions. Word has length 68 [2025-01-09 06:05:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:13,702 INFO L471 AbstractCegarLoop]: Abstraction has 3395 states and 4365 transitions. [2025-01-09 06:05:13,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 4365 transitions. [2025-01-09 06:05:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:05:13,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:13,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:13,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:05:13,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:13,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash 616676808, now seen corresponding path program 1 times [2025-01-09 06:05:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207124316] [2025-01-09 06:05:13,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:13,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:05:13,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:05:13,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:13,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207124316] [2025-01-09 06:05:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207124316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649033700] [2025-01-09 06:05:13,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:13,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:13,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:13,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:05:13,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 06:05:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:05:14,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:05:14,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:14,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:14,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:05:14,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:14,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:05:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649033700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:05:14,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:05:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:05:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142708070] [2025-01-09 06:05:14,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:05:14,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:05:14,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:14,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:05:14,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:14,427 INFO L87 Difference]: Start difference. First operand 3395 states and 4365 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:05:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:15,231 INFO L93 Difference]: Finished difference Result 7120 states and 9063 transitions. [2025-01-09 06:05:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:05:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-01-09 06:05:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:15,266 INFO L225 Difference]: With dead ends: 7120 [2025-01-09 06:05:15,267 INFO L226 Difference]: Without dead ends: 7117 [2025-01-09 06:05:15,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:15,273 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 1542 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:15,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2966 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2025-01-09 06:05:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 5118. [2025-01-09 06:05:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5118 states, 3994 states have (on average 1.2959439158738106) internal successors, (5176), 4058 states have internal predecessors, (5176), 555 states have call successors, (555), 452 states have call predecessors, (555), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2025-01-09 06:05:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 6536 transitions. [2025-01-09 06:05:15,632 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 6536 transitions. Word has length 69 [2025-01-09 06:05:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:15,633 INFO L471 AbstractCegarLoop]: Abstraction has 5118 states and 6536 transitions. [2025-01-09 06:05:15,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:05:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 6536 transitions. [2025-01-09 06:05:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:05:15,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:15,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:15,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 06:05:15,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 06:05:15,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:15,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -200945722, now seen corresponding path program 2 times [2025-01-09 06:05:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739450311] [2025-01-09 06:05:15,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:05:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:15,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:05:15,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:05:15,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:05:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739450311] [2025-01-09 06:05:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739450311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036705724] [2025-01-09 06:05:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:15,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:15,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:15,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:15,879 INFO L87 Difference]: Start difference. First operand 5118 states and 6536 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:16,083 INFO L93 Difference]: Finished difference Result 7492 states and 9572 transitions. [2025-01-09 06:05:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:16,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-01-09 06:05:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:16,100 INFO L225 Difference]: With dead ends: 7492 [2025-01-09 06:05:16,100 INFO L226 Difference]: Without dead ends: 3567 [2025-01-09 06:05:16,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:16,109 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 620 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:16,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 844 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2025-01-09 06:05:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3547. [2025-01-09 06:05:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 2779 states have (on average 1.2857142857142858) internal successors, (3573), 2821 states have internal predecessors, (3573), 387 states have call successors, (387), 308 states have call predecessors, (387), 379 states have return successors, (531), 424 states have call predecessors, (531), 384 states have call successors, (531) [2025-01-09 06:05:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 4491 transitions. [2025-01-09 06:05:16,344 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 4491 transitions. Word has length 71 [2025-01-09 06:05:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:16,345 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 4491 transitions. [2025-01-09 06:05:16,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 4491 transitions. [2025-01-09 06:05:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:05:16,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:16,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:16,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:05:16,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:16,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1945317695, now seen corresponding path program 1 times [2025-01-09 06:05:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642990182] [2025-01-09 06:05:16,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:16,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:05:16,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:05:16,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:16,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 06:05:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642990182] [2025-01-09 06:05:16,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642990182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:16,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:16,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:16,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759213263] [2025-01-09 06:05:16,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:16,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:16,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:16,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:16,451 INFO L87 Difference]: Start difference. First operand 3547 states and 4491 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:17,780 INFO L93 Difference]: Finished difference Result 10171 states and 12660 transitions. [2025-01-09 06:05:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:05:17,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-01-09 06:05:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:17,819 INFO L225 Difference]: With dead ends: 10171 [2025-01-09 06:05:17,820 INFO L226 Difference]: Without dead ends: 5719 [2025-01-09 06:05:17,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 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-01-09 06:05:17,833 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 719 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:17,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1820 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:05:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2025-01-09 06:05:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5462. [2025-01-09 06:05:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5462 states, 4242 states have (on average 1.2517680339462518) internal successors, (5310), 4320 states have internal predecessors, (5310), 596 states have call successors, (596), 490 states have call predecessors, (596), 622 states have return successors, (887), 658 states have call predecessors, (887), 593 states have call successors, (887) [2025-01-09 06:05:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 6793 transitions. [2025-01-09 06:05:18,273 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 6793 transitions. Word has length 80 [2025-01-09 06:05:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:18,273 INFO L471 AbstractCegarLoop]: Abstraction has 5462 states and 6793 transitions. [2025-01-09 06:05:18,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 6793 transitions. [2025-01-09 06:05:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:05:18,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:18,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:18,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:05:18,280 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:18,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1914582337, now seen corresponding path program 1 times [2025-01-09 06:05:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754478975] [2025-01-09 06:05:18,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:18,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:05:18,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:05:18,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:18,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:05:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754478975] [2025-01-09 06:05:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754478975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:05:18,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621418287] [2025-01-09 06:05:18,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:05:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:18,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:05:18,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:18,400 INFO L87 Difference]: Start difference. First operand 5462 states and 6793 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:19,506 INFO L93 Difference]: Finished difference Result 9353 states and 11543 transitions. [2025-01-09 06:05:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:05:19,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-01-09 06:05:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:19,535 INFO L225 Difference]: With dead ends: 9353 [2025-01-09 06:05:19,536 INFO L226 Difference]: Without dead ends: 4871 [2025-01-09 06:05:19,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 06:05:19,548 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1536 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:19,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 1895 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:05:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2025-01-09 06:05:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4590. [2025-01-09 06:05:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4590 states, 3576 states have (on average 1.246364653243848) internal successors, (4457), 3637 states have internal predecessors, (4457), 500 states have call successors, (500), 405 states have call predecessors, (500), 512 states have return successors, (675), 554 states have call predecessors, (675), 497 states have call successors, (675) [2025-01-09 06:05:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 5632 transitions. [2025-01-09 06:05:19,848 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 5632 transitions. Word has length 86 [2025-01-09 06:05:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:19,849 INFO L471 AbstractCegarLoop]: Abstraction has 4590 states and 5632 transitions. [2025-01-09 06:05:19,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 5632 transitions. [2025-01-09 06:05:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 06:05:19,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:19,855 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:19,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:05:19,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:19,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2020574904, now seen corresponding path program 1 times [2025-01-09 06:05:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568946126] [2025-01-09 06:05:19,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:19,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 06:05:19,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 06:05:19,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:19,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 06:05:19,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:19,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568946126] [2025-01-09 06:05:19,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568946126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:19,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092717931] [2025-01-09 06:05:19,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:19,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:19,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:19,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:05:19,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:05:20,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 06:05:20,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 06:05:20,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:20,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:20,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 06:05:20,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 06:05:20,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:05:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092717931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:20,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:05:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-09 06:05:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737351657] [2025-01-09 06:05:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:20,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:20,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:20,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:05:20,140 INFO L87 Difference]: Start difference. First operand 4590 states and 5632 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 06:05:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:20,245 INFO L93 Difference]: Finished difference Result 6513 states and 7959 transitions. [2025-01-09 06:05:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:20,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-01-09 06:05:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:20,256 INFO L225 Difference]: With dead ends: 6513 [2025-01-09 06:05:20,257 INFO L226 Difference]: Without dead ends: 2282 [2025-01-09 06:05:20,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:05:20,266 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 0 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3216 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:20,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3216 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2025-01-09 06:05:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2025-01-09 06:05:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 1847 states have (on average 1.2717920952896589) internal successors, (2349), 1863 states have internal predecessors, (2349), 216 states have call successors, (216), 163 states have call predecessors, (216), 217 states have return successors, (296), 256 states have call predecessors, (296), 213 states have call successors, (296) [2025-01-09 06:05:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 2861 transitions. [2025-01-09 06:05:20,428 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 2861 transitions. Word has length 139 [2025-01-09 06:05:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:20,428 INFO L471 AbstractCegarLoop]: Abstraction has 2282 states and 2861 transitions. [2025-01-09 06:05:20,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 06:05:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2861 transitions. [2025-01-09 06:05:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 06:05:20,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:20,434 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:20,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 06:05:20,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 06:05:20,635 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:20,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash -14582746, now seen corresponding path program 1 times [2025-01-09 06:05:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206678166] [2025-01-09 06:05:20,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:20,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 06:05:20,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 06:05:20,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:20,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 06:05:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206678166] [2025-01-09 06:05:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206678166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:20,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396927312] [2025-01-09 06:05:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:20,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:20,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:20,681 INFO L87 Difference]: Start difference. First operand 2282 states and 2861 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 06:05:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:20,747 INFO L93 Difference]: Finished difference Result 2285 states and 2863 transitions. [2025-01-09 06:05:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:20,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 141 [2025-01-09 06:05:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:20,754 INFO L225 Difference]: With dead ends: 2285 [2025-01-09 06:05:20,754 INFO L226 Difference]: Without dead ends: 1859 [2025-01-09 06:05:20,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:20,757 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 119 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1169 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-01-09 06:05:20,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1169 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-01-09 06:05:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1859. [2025-01-09 06:05:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1520 states have (on average 1.2907894736842105) internal successors, (1962), 1533 states have internal predecessors, (1962), 170 states have call successors, (170), 123 states have call predecessors, (170), 167 states have return successors, (233), 203 states have call predecessors, (233), 167 states have call successors, (233) [2025-01-09 06:05:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2365 transitions. [2025-01-09 06:05:20,844 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2365 transitions. Word has length 141 [2025-01-09 06:05:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:20,844 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2365 transitions. [2025-01-09 06:05:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 06:05:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2365 transitions. [2025-01-09 06:05:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 06:05:20,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:20,848 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:20,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:05:20,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:20,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash 792427057, now seen corresponding path program 1 times [2025-01-09 06:05:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731660262] [2025-01-09 06:05:20,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:20,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 06:05:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 06:05:20,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:20,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 06:05:20,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:20,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731660262] [2025-01-09 06:05:20,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731660262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:20,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:20,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728719053] [2025-01-09 06:05:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:20,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:20,926 INFO L87 Difference]: Start difference. First operand 1859 states and 2365 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 06:05:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:21,487 INFO L93 Difference]: Finished difference Result 3180 states and 4003 transitions. [2025-01-09 06:05:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2025-01-09 06:05:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:21,498 INFO L225 Difference]: With dead ends: 3180 [2025-01-09 06:05:21,498 INFO L226 Difference]: Without dead ends: 1882 [2025-01-09 06:05:21,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:21,501 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 322 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:21,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1353 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-01-09 06:05:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1813. [2025-01-09 06:05:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1490 states have (on average 1.2906040268456376) internal successors, (1923), 1505 states have internal predecessors, (1923), 164 states have call successors, (164), 121 states have call predecessors, (164), 157 states have return successors, (221), 187 states have call predecessors, (221), 161 states have call successors, (221) [2025-01-09 06:05:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2308 transitions. [2025-01-09 06:05:21,649 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2308 transitions. Word has length 150 [2025-01-09 06:05:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:21,649 INFO L471 AbstractCegarLoop]: Abstraction has 1813 states and 2308 transitions. [2025-01-09 06:05:21,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 06:05:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2308 transitions. [2025-01-09 06:05:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 06:05:21,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:21,653 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:21,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:05:21,653 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:21,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:21,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1673045203, now seen corresponding path program 1 times [2025-01-09 06:05:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:21,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922964603] [2025-01-09 06:05:21,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:21,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 06:05:21,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 06:05:21,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:21,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 06:05:21,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:21,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922964603] [2025-01-09 06:05:21,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922964603] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:21,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479101210] [2025-01-09 06:05:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:21,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:05:21,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 06:05:21,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 06:05:22,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 06:05:22,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:22,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:22,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 06:05:22,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 06:05:22,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:05:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 06:05:22,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479101210] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:05:22,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:05:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-01-09 06:05:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465195305] [2025-01-09 06:05:22,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:05:22,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 06:05:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:22,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 06:05:22,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:05:22,386 INFO L87 Difference]: Start difference. First operand 1813 states and 2308 transitions. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 06:05:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:23,803 INFO L93 Difference]: Finished difference Result 3826 states and 4837 transitions. [2025-01-09 06:05:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 06:05:23,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 153 [2025-01-09 06:05:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:23,814 INFO L225 Difference]: With dead ends: 3826 [2025-01-09 06:05:23,814 INFO L226 Difference]: Without dead ends: 2443 [2025-01-09 06:05:23,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-01-09 06:05:23,818 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1505 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:23,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 2151 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 06:05:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2025-01-09 06:05:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2261. [2025-01-09 06:05:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1818 states have (on average 1.2541254125412542) internal successors, (2280), 1841 states have internal predecessors, (2280), 222 states have call successors, (222), 175 states have call predecessors, (222), 219 states have return successors, (339), 245 states have call predecessors, (339), 219 states have call successors, (339) [2025-01-09 06:05:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2841 transitions. [2025-01-09 06:05:23,982 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2841 transitions. Word has length 153 [2025-01-09 06:05:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:23,983 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2841 transitions. [2025-01-09 06:05:23,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 06:05:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2841 transitions. [2025-01-09 06:05:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:23,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:23,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:23,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 06:05:24,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:24,187 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:24,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 984047237, now seen corresponding path program 1 times [2025-01-09 06:05:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:24,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620575330] [2025-01-09 06:05:24,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:24,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:24,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:24,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:24,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620575330] [2025-01-09 06:05:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620575330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423833781] [2025-01-09 06:05:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:24,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:24,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:24,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:24,237 INFO L87 Difference]: Start difference. First operand 2261 states and 2841 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-09 06:05:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:24,325 INFO L93 Difference]: Finished difference Result 2587 states and 3356 transitions. [2025-01-09 06:05:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:24,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:24,334 INFO L225 Difference]: With dead ends: 2587 [2025-01-09 06:05:24,334 INFO L226 Difference]: Without dead ends: 2261 [2025-01-09 06:05:24,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:24,336 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 517 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 769 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-01-09 06:05:24,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 769 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-01-09 06:05:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2025-01-09 06:05:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1818 states have (on average 1.2535753575357536) internal successors, (2279), 1841 states have internal predecessors, (2279), 222 states have call successors, (222), 175 states have call predecessors, (222), 219 states have return successors, (339), 245 states have call predecessors, (339), 219 states have call successors, (339) [2025-01-09 06:05:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2840 transitions. [2025-01-09 06:05:24,486 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2840 transitions. Word has length 155 [2025-01-09 06:05:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:24,486 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2840 transitions. [2025-01-09 06:05:24,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-09 06:05:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2840 transitions. [2025-01-09 06:05:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:24,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:24,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:24,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:05:24,490 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:24,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash -947078397, now seen corresponding path program 1 times [2025-01-09 06:05:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336936313] [2025-01-09 06:05:24,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:24,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:24,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:24,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:24,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:24,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336936313] [2025-01-09 06:05:24,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336936313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:24,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:24,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765055742] [2025-01-09 06:05:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:24,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:24,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:24,538 INFO L87 Difference]: Start difference. First operand 2261 states and 2840 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-09 06:05:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:24,626 INFO L93 Difference]: Finished difference Result 2579 states and 3339 transitions. [2025-01-09 06:05:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:24,635 INFO L225 Difference]: With dead ends: 2579 [2025-01-09 06:05:24,635 INFO L226 Difference]: Without dead ends: 2261 [2025-01-09 06:05:24,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:24,639 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 508 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 768 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-01-09 06:05:24,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 768 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-01-09 06:05:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2025-01-09 06:05:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1818 states have (on average 1.2530253025302531) internal successors, (2278), 1841 states have internal predecessors, (2278), 222 states have call successors, (222), 175 states have call predecessors, (222), 219 states have return successors, (339), 245 states have call predecessors, (339), 219 states have call successors, (339) [2025-01-09 06:05:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2839 transitions. [2025-01-09 06:05:24,751 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2839 transitions. Word has length 155 [2025-01-09 06:05:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:24,752 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2839 transitions. [2025-01-09 06:05:24,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-01-09 06:05:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2839 transitions. [2025-01-09 06:05:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:24,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:24,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:24,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:05:24,757 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:24,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash 840791425, now seen corresponding path program 1 times [2025-01-09 06:05:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716022300] [2025-01-09 06:05:24,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:24,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:24,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:24,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:24,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716022300] [2025-01-09 06:05:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716022300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:24,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:24,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100083072] [2025-01-09 06:05:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:24,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:24,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:24,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:24,850 INFO L87 Difference]: Start difference. First operand 2261 states and 2839 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:25,492 INFO L93 Difference]: Finished difference Result 2929 states and 3905 transitions. [2025-01-09 06:05:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:25,503 INFO L225 Difference]: With dead ends: 2929 [2025-01-09 06:05:25,504 INFO L226 Difference]: Without dead ends: 2615 [2025-01-09 06:05:25,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:25,506 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1152 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:25,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1591 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2025-01-09 06:05:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 2588. [2025-01-09 06:05:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2588 states, 2119 states have (on average 1.3025011798017934) internal successors, (2760), 2143 states have internal predecessors, (2760), 241 states have call successors, (241), 181 states have call predecessors, (241), 226 states have return successors, (359), 264 states have call predecessors, (359), 238 states have call successors, (359) [2025-01-09 06:05:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3360 transitions. [2025-01-09 06:05:25,629 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3360 transitions. Word has length 155 [2025-01-09 06:05:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:25,629 INFO L471 AbstractCegarLoop]: Abstraction has 2588 states and 3360 transitions. [2025-01-09 06:05:25,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3360 transitions. [2025-01-09 06:05:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:25,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:25,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:25,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:05:25,635 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:25,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2146510973, now seen corresponding path program 1 times [2025-01-09 06:05:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514737989] [2025-01-09 06:05:25,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:25,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:25,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:25,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:25,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:25,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:25,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514737989] [2025-01-09 06:05:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514737989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:25,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:25,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963093039] [2025-01-09 06:05:25,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:25,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:25,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:25,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:25,760 INFO L87 Difference]: Start difference. First operand 2588 states and 3360 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:26,585 INFO L93 Difference]: Finished difference Result 3648 states and 5068 transitions. [2025-01-09 06:05:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:26,594 INFO L225 Difference]: With dead ends: 3648 [2025-01-09 06:05:26,594 INFO L226 Difference]: Without dead ends: 3007 [2025-01-09 06:05:26,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:26,597 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1157 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 2978 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:26,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 2978 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:05:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2025-01-09 06:05:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2892. [2025-01-09 06:05:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2397 states have (on average 1.3333333333333333) internal successors, (3196), 2422 states have internal predecessors, (3196), 260 states have call successors, (260), 187 states have call predecessors, (260), 233 states have return successors, (381), 284 states have call predecessors, (381), 257 states have call successors, (381) [2025-01-09 06:05:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 3837 transitions. [2025-01-09 06:05:26,725 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 3837 transitions. Word has length 155 [2025-01-09 06:05:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:26,726 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 3837 transitions. [2025-01-09 06:05:26,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 3837 transitions. [2025-01-09 06:05:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:26,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:26,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:05:26,730 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1784989825, now seen corresponding path program 1 times [2025-01-09 06:05:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428440335] [2025-01-09 06:05:26,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:26,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:26,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:26,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:26,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:26,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428440335] [2025-01-09 06:05:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428440335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043891655] [2025-01-09 06:05:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:26,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:26,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:26,836 INFO L87 Difference]: Start difference. First operand 2892 states and 3837 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:27,710 INFO L93 Difference]: Finished difference Result 4618 states and 6614 transitions. [2025-01-09 06:05:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:27,722 INFO L225 Difference]: With dead ends: 4618 [2025-01-09 06:05:27,722 INFO L226 Difference]: Without dead ends: 3673 [2025-01-09 06:05:27,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:27,725 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1152 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:27,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 2962 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2025-01-09 06:05:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3541. [2025-01-09 06:05:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2992 states have (on average 1.384692513368984) internal successors, (4143), 3021 states have internal predecessors, (4143), 298 states have call successors, (298), 199 states have call predecessors, (298), 249 states have return successors, (431), 324 states have call predecessors, (431), 295 states have call successors, (431) [2025-01-09 06:05:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 4872 transitions. [2025-01-09 06:05:27,949 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 4872 transitions. Word has length 155 [2025-01-09 06:05:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:27,949 INFO L471 AbstractCegarLoop]: Abstraction has 3541 states and 4872 transitions. [2025-01-09 06:05:27,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 4872 transitions. [2025-01-09 06:05:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:27,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:27,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:27,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:05:27,953 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:27,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1496170435, now seen corresponding path program 1 times [2025-01-09 06:05:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:27,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233582900] [2025-01-09 06:05:27,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:27,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:27,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:27,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:27,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:27,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233582900] [2025-01-09 06:05:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233582900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765201225] [2025-01-09 06:05:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:28,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:28,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:28,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:28,042 INFO L87 Difference]: Start difference. First operand 3541 states and 4872 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:28,847 INFO L93 Difference]: Finished difference Result 6717 states and 10027 transitions. [2025-01-09 06:05:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:28,864 INFO L225 Difference]: With dead ends: 6717 [2025-01-09 06:05:28,864 INFO L226 Difference]: Without dead ends: 5123 [2025-01-09 06:05:28,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:28,871 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1147 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:28,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 2950 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:05:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5123 states. [2025-01-09 06:05:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5123 to 4956. [2025-01-09 06:05:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4293 states have (on average 1.4560913114372234) internal successors, (6251), 4336 states have internal predecessors, (6251), 374 states have call successors, (374), 223 states have call predecessors, (374), 287 states have return successors, (555), 404 states have call predecessors, (555), 371 states have call successors, (555) [2025-01-09 06:05:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 7180 transitions. [2025-01-09 06:05:29,299 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 7180 transitions. Word has length 155 [2025-01-09 06:05:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:29,300 INFO L471 AbstractCegarLoop]: Abstraction has 4956 states and 7180 transitions. [2025-01-09 06:05:29,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 7180 transitions. [2025-01-09 06:05:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:29,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:29,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:29,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:05:29,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:29,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2041043009, now seen corresponding path program 1 times [2025-01-09 06:05:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:29,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989647292] [2025-01-09 06:05:29,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:29,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:29,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:29,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:29,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:29,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989647292] [2025-01-09 06:05:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989647292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:29,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302084141] [2025-01-09 06:05:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:29,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:29,437 INFO L87 Difference]: Start difference. First operand 4956 states and 7180 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:30,359 INFO L93 Difference]: Finished difference Result 11364 states and 17793 transitions. [2025-01-09 06:05:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:30,399 INFO L225 Difference]: With dead ends: 11364 [2025-01-09 06:05:30,400 INFO L226 Difference]: Without dead ends: 8355 [2025-01-09 06:05:30,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:30,423 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1142 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:30,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 2938 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:05:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2025-01-09 06:05:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 8119. [2025-01-09 06:05:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8119 states, 7210 states have (on average 1.5360610263522885) internal successors, (11075), 7299 states have internal predecessors, (11075), 526 states have call successors, (526), 271 states have call predecessors, (526), 381 states have return successors, (899), 564 states have call predecessors, (899), 523 states have call successors, (899) [2025-01-09 06:05:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8119 states to 8119 states and 12500 transitions. [2025-01-09 06:05:31,184 INFO L78 Accepts]: Start accepts. Automaton has 8119 states and 12500 transitions. Word has length 155 [2025-01-09 06:05:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:31,184 INFO L471 AbstractCegarLoop]: Abstraction has 8119 states and 12500 transitions. [2025-01-09 06:05:31,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 8119 states and 12500 transitions. [2025-01-09 06:05:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:31,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:31,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:31,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:05:31,198 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:31,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:31,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1365882883, now seen corresponding path program 1 times [2025-01-09 06:05:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:31,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327997020] [2025-01-09 06:05:31,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:31,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:31,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:31,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:31,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:31,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327997020] [2025-01-09 06:05:31,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327997020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:31,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:31,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:31,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418846591] [2025-01-09 06:05:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:31,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:31,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:31,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:31,364 INFO L87 Difference]: Start difference. First operand 8119 states and 12500 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:32,460 INFO L93 Difference]: Finished difference Result 15785 states and 25684 transitions. [2025-01-09 06:05:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:32,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:32,508 INFO L225 Difference]: With dead ends: 15785 [2025-01-09 06:05:32,509 INFO L226 Difference]: Without dead ends: 9613 [2025-01-09 06:05:32,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:32,527 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 894 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:32,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1104 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:05:32,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9613 states. [2025-01-09 06:05:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9613 to 8119. [2025-01-09 06:05:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8119 states, 7210 states have (on average 1.5337031900138696) internal successors, (11058), 7299 states have internal predecessors, (11058), 526 states have call successors, (526), 271 states have call predecessors, (526), 381 states have return successors, (899), 564 states have call predecessors, (899), 523 states have call successors, (899) [2025-01-09 06:05:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8119 states to 8119 states and 12483 transitions. [2025-01-09 06:05:32,934 INFO L78 Accepts]: Start accepts. Automaton has 8119 states and 12483 transitions. Word has length 155 [2025-01-09 06:05:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:32,934 INFO L471 AbstractCegarLoop]: Abstraction has 8119 states and 12483 transitions. [2025-01-09 06:05:32,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8119 states and 12483 transitions. [2025-01-09 06:05:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:32,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:32,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:05:32,940 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:32,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1981032447, now seen corresponding path program 1 times [2025-01-09 06:05:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674560386] [2025-01-09 06:05:32,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:32,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:32,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:32,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:32,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674560386] [2025-01-09 06:05:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674560386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:33,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463948773] [2025-01-09 06:05:33,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:33,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:33,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:33,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:33,018 INFO L87 Difference]: Start difference. First operand 8119 states and 12483 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:34,087 INFO L93 Difference]: Finished difference Result 15619 states and 25318 transitions. [2025-01-09 06:05:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:34,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:34,153 INFO L225 Difference]: With dead ends: 15619 [2025-01-09 06:05:34,154 INFO L226 Difference]: Without dead ends: 9447 [2025-01-09 06:05:34,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:34,190 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 857 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:34,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1160 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:05:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9447 states. [2025-01-09 06:05:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9447 to 8119. [2025-01-09 06:05:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8119 states, 7210 states have (on average 1.5313453536754507) internal successors, (11041), 7299 states have internal predecessors, (11041), 526 states have call successors, (526), 271 states have call predecessors, (526), 381 states have return successors, (899), 564 states have call predecessors, (899), 523 states have call successors, (899) [2025-01-09 06:05:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8119 states to 8119 states and 12466 transitions. [2025-01-09 06:05:35,008 INFO L78 Accepts]: Start accepts. Automaton has 8119 states and 12466 transitions. Word has length 155 [2025-01-09 06:05:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:35,008 INFO L471 AbstractCegarLoop]: Abstraction has 8119 states and 12466 transitions. [2025-01-09 06:05:35,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8119 states and 12466 transitions. [2025-01-09 06:05:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:35,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:35,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:35,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:05:35,013 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:35,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1546526849, now seen corresponding path program 1 times [2025-01-09 06:05:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:35,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032644184] [2025-01-09 06:05:35,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:35,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:35,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:35,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:35,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032644184] [2025-01-09 06:05:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032644184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:35,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766805285] [2025-01-09 06:05:35,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:35,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:35,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:35,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:35,092 INFO L87 Difference]: Start difference. First operand 8119 states and 12466 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:36,411 INFO L93 Difference]: Finished difference Result 21631 states and 35421 transitions. [2025-01-09 06:05:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:36,474 INFO L225 Difference]: With dead ends: 21631 [2025-01-09 06:05:36,474 INFO L226 Difference]: Without dead ends: 15459 [2025-01-09 06:05:36,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:36,509 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 1118 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:36,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 2874 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:05:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2025-01-09 06:05:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 15147. [2025-01-09 06:05:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15147 states, 13692 states have (on average 1.5988168273444348) internal successors, (21891), 13927 states have internal predecessors, (21891), 830 states have call successors, (830), 367 states have call predecessors, (830), 623 states have return successors, (1971), 884 states have call predecessors, (1971), 827 states have call successors, (1971) [2025-01-09 06:05:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15147 states to 15147 states and 24692 transitions. [2025-01-09 06:05:37,737 INFO L78 Accepts]: Start accepts. Automaton has 15147 states and 24692 transitions. Word has length 155 [2025-01-09 06:05:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:37,738 INFO L471 AbstractCegarLoop]: Abstraction has 15147 states and 24692 transitions. [2025-01-09 06:05:37,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15147 states and 24692 transitions. [2025-01-09 06:05:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:37,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:37,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:37,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 06:05:37,746 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1116868543, now seen corresponding path program 1 times [2025-01-09 06:05:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035405819] [2025-01-09 06:05:37,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:37,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:37,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:37,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:37,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:37,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035405819] [2025-01-09 06:05:37,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035405819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:37,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:37,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337518267] [2025-01-09 06:05:37,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:37,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:37,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:37,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:37,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:37,908 INFO L87 Difference]: Start difference. First operand 15147 states and 24692 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:39,152 INFO L93 Difference]: Finished difference Result 31777 states and 54254 transitions. [2025-01-09 06:05:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:39,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:39,205 INFO L225 Difference]: With dead ends: 31777 [2025-01-09 06:05:39,205 INFO L226 Difference]: Without dead ends: 18577 [2025-01-09 06:05:39,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:39,250 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 853 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:39,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1146 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18577 states. [2025-01-09 06:05:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18577 to 15147. [2025-01-09 06:05:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15147 states, 13692 states have (on average 1.5964066608238388) internal successors, (21858), 13927 states have internal predecessors, (21858), 830 states have call successors, (830), 367 states have call predecessors, (830), 623 states have return successors, (1971), 884 states have call predecessors, (1971), 827 states have call successors, (1971) [2025-01-09 06:05:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15147 states to 15147 states and 24659 transitions. [2025-01-09 06:05:40,866 INFO L78 Accepts]: Start accepts. Automaton has 15147 states and 24659 transitions. Word has length 155 [2025-01-09 06:05:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:40,866 INFO L471 AbstractCegarLoop]: Abstraction has 15147 states and 24659 transitions. [2025-01-09 06:05:40,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15147 states and 24659 transitions. [2025-01-09 06:05:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:40,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:40,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:40,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 06:05:40,875 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 410271937, now seen corresponding path program 1 times [2025-01-09 06:05:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082225609] [2025-01-09 06:05:40,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:40,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:40,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:41,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-01-09 06:05:41,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:41,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082225609] [2025-01-09 06:05:41,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082225609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:41,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:41,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660810121] [2025-01-09 06:05:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:41,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:41,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:41,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:41,056 INFO L87 Difference]: Start difference. First operand 15147 states and 24659 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:42,909 INFO L93 Difference]: Finished difference Result 44829 states and 77262 transitions. [2025-01-09 06:05:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:43,015 INFO L225 Difference]: With dead ends: 44829 [2025-01-09 06:05:43,016 INFO L226 Difference]: Without dead ends: 31629 [2025-01-09 06:05:43,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:43,053 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1105 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:43,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 2843 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31629 states. [2025-01-09 06:05:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31629 to 31147. [2025-01-09 06:05:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31147 states, 28438 states have (on average 1.6496237428792462) internal successors, (46912), 29127 states have internal predecessors, (46912), 1438 states have call successors, (1438), 559 states have call predecessors, (1438), 1269 states have return successors, (5651), 1524 states have call predecessors, (5651), 1435 states have call successors, (5651) [2025-01-09 06:05:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31147 states to 31147 states and 54001 transitions. [2025-01-09 06:05:44,600 INFO L78 Accepts]: Start accepts. Automaton has 31147 states and 54001 transitions. Word has length 155 [2025-01-09 06:05:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:44,601 INFO L471 AbstractCegarLoop]: Abstraction has 31147 states and 54001 transitions. [2025-01-09 06:05:44,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 31147 states and 54001 transitions. [2025-01-09 06:05:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:44,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:44,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 06:05:44,613 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1357309823, now seen corresponding path program 1 times [2025-01-09 06:05:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649168490] [2025-01-09 06:05:44,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:44,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:44,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:44,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:44,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649168490] [2025-01-09 06:05:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649168490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:44,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476507537] [2025-01-09 06:05:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:44,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:44,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:44,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:44,719 INFO L87 Difference]: Start difference. First operand 31147 states and 54001 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:48,425 INFO L93 Difference]: Finished difference Result 103567 states and 189179 transitions. [2025-01-09 06:05:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:48,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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 155 [2025-01-09 06:05:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:48,681 INFO L225 Difference]: With dead ends: 103567 [2025-01-09 06:05:48,681 INFO L226 Difference]: Without dead ends: 74367 [2025-01-09 06:05:48,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:48,759 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1203 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:48,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 2818 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:05:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74367 states. [2025-01-09 06:05:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74367 to 68544. [2025-01-09 06:05:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68544 states, 62905 states have (on average 1.69430092997377) internal successors, (106580), 64988 states have internal predecessors, (106580), 2590 states have call successors, (2590), 943 states have call predecessors, (2590), 3047 states have return successors, (19091), 2740 states have call predecessors, (19091), 2587 states have call successors, (19091) [2025-01-09 06:05:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68544 states to 68544 states and 128261 transitions. [2025-01-09 06:05:53,691 INFO L78 Accepts]: Start accepts. Automaton has 68544 states and 128261 transitions. Word has length 155 [2025-01-09 06:05:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:53,692 INFO L471 AbstractCegarLoop]: Abstraction has 68544 states and 128261 transitions. [2025-01-09 06:05:53,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:05:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 68544 states and 128261 transitions. [2025-01-09 06:05:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 06:05:53,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:53,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:53,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 06:05:53,714 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:53,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2075823871, now seen corresponding path program 1 times [2025-01-09 06:05:53,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:53,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760275191] [2025-01-09 06:05:53,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:53,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:53,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 06:05:53,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 06:05:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:53,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760275191] [2025-01-09 06:05:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760275191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939603474] [2025-01-09 06:05:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:53,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:53,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:53,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:53,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:53,882 INFO L87 Difference]: Start difference. First operand 68544 states and 128261 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 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)