./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.14.cil.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.14.cil.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 a6e26dc8018dcf216dd711848cc7425da3593cca9604197466413681bb8c438e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:05:45,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:05:45,971 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:45,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:05:45,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:05:45,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:05:46,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:05:46,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:05:46,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:05:46,001 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:05:46,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:05:46,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:05:46,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:05:46,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:05:46,002 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:05:46,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:05:46,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:46,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:05:46,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:46,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:05:46,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:05:46,004 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 -> a6e26dc8018dcf216dd711848cc7425da3593cca9604197466413681bb8c438e [2025-01-09 06:05:46,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:05:46,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:05:46,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:05:46,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:05:46,265 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:05:46,267 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.14.cil.c [2025-01-09 06:05:47,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f1a42688/330026d38c974e4dbe4141dc0ca6ab36/FLAGdb3d16792 [2025-01-09 06:05:47,747 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:05:47,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.14.cil.c [2025-01-09 06:05:47,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f1a42688/330026d38c974e4dbe4141dc0ca6ab36/FLAGdb3d16792 [2025-01-09 06:05:47,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f1a42688/330026d38c974e4dbe4141dc0ca6ab36 [2025-01-09 06:05:47,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:05:47,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:05:47,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:05:47,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:05:47,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:05:47,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:47" (1/1) ... [2025-01-09 06:05:47,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c88d4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:47, skipping insertion in model container [2025-01-09 06:05:47,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:47" (1/1) ... [2025-01-09 06:05:47,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:05:47,935 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.14.cil.c[914,927] [2025-01-09 06:05:47,989 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.14.cil.c[7115,7128] [2025-01-09 06:05:48,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:05:48,133 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:05:48,144 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.14.cil.c[914,927] [2025-01-09 06:05:48,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.14.cil.c[7115,7128] [2025-01-09 06:05:48,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:05:48,245 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:05:48,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:48 WrapperNode [2025-01-09 06:05:48,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:05:48,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:05:48,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:05:48,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:05:48,253 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:48" (1/1) ... [2025-01-09 06:05:48,267 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:48" (1/1) ... [2025-01-09 06:05:48,313 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1015 [2025-01-09 06:05:48,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:05:48,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:05:48,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:05:48,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:05:48,324 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:48" (1/1) ... [2025-01-09 06:05:48,324 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:48" (1/1) ... [2025-01-09 06:05:48,327 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:48" (1/1) ... [2025-01-09 06:05:48,342 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:48,342 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:48" (1/1) ... [2025-01-09 06:05:48,342 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:48" (1/1) ... [2025-01-09 06:05:48,354 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:48" (1/1) ... [2025-01-09 06:05:48,356 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:48" (1/1) ... [2025-01-09 06:05:48,363 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:48" (1/1) ... [2025-01-09 06:05:48,365 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:48" (1/1) ... [2025-01-09 06:05:48,370 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:48" (1/1) ... [2025-01-09 06:05:48,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:05:48,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:05:48,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:05:48,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:05:48,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:48" (1/1) ... [2025-01-09 06:05:48,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:48,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:48,412 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:48,415 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:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:05:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:05:48,434 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:05:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:05:48,434 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:05:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:05:48,435 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:05:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:05:48,435 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:05:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:05:48,435 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:05:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:05:48,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:05:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:05:48,436 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:05:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:05:48,437 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:05:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:05:48,437 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:05:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:05:48,438 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:05:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:05:48,438 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:05:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:05:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:05:48,440 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:05:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:05:48,440 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:05:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:05:48,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:05:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:05:48,440 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:05:48,440 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:05:48,440 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:05:48,558 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:05:48,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:05:49,383 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-01-09 06:05:49,383 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:05:49,404 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:05:49,404 INFO L312 CfgBuilder]: Removed 19 assume(true) statements. [2025-01-09 06:05:49,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:49 BoogieIcfgContainer [2025-01-09 06:05:49,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:05:49,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:05:49,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:05:49,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:05:49,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:05:47" (1/3) ... [2025-01-09 06:05:49,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fbf7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:49, skipping insertion in model container [2025-01-09 06:05:49,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:48" (2/3) ... [2025-01-09 06:05:49,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fbf7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:49, skipping insertion in model container [2025-01-09 06:05:49,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:49" (3/3) ... [2025-01-09 06:05:49,412 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.14.cil.c [2025-01-09 06:05:49,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:05:49,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.14.cil.c that has 16 procedures, 483 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-01-09 06:05:49,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:05:49,501 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;@582bc3ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:05:49,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:05:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 483 states, 425 states have (on average 1.6) internal successors, (680), 431 states have internal predecessors, (680), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 06:05:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:49,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:49,514 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:49,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:49,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash -381931393, now seen corresponding path program 1 times [2025-01-09 06:05:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912810997] [2025-01-09 06:05:49,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:49,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:49,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:49,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:49,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:49,949 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:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912810997] [2025-01-09 06:05:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912810997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169486373] [2025-01-09 06:05:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:49,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:49,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:49,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:49,974 INFO L87 Difference]: Start difference. First operand has 483 states, 425 states have (on average 1.6) internal successors, (680), 431 states have internal predecessors, (680), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) 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:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:50,947 INFO L93 Difference]: Finished difference Result 1036 states and 1632 transitions. [2025-01-09 06:05:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:50,949 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:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:50,963 INFO L225 Difference]: With dead ends: 1036 [2025-01-09 06:05:50,967 INFO L226 Difference]: Without dead ends: 571 [2025-01-09 06:05:50,973 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:50,976 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 477 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:50,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1536 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:05:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-01-09 06:05:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 564. [2025-01-09 06:05:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 487 states have (on average 1.540041067761807) internal successors, (750), 494 states have internal predecessors, (750), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2025-01-09 06:05:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 857 transitions. [2025-01-09 06:05:51,067 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 857 transitions. Word has length 62 [2025-01-09 06:05:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:51,068 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 857 transitions. [2025-01-09 06:05:51,069 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:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 857 transitions. [2025-01-09 06:05:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:51,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:51,071 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:51,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:05:51,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:51,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash -663770112, now seen corresponding path program 1 times [2025-01-09 06:05:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:51,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327840090] [2025-01-09 06:05:51,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:51,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:51,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:51,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:51,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:51,328 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:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:51,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327840090] [2025-01-09 06:05:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327840090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129945528] [2025-01-09 06:05:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:51,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:51,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:51,334 INFO L87 Difference]: Start difference. First operand 564 states and 857 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:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:52,377 INFO L93 Difference]: Finished difference Result 869 states and 1276 transitions. [2025-01-09 06:05:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:52,377 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:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:52,388 INFO L225 Difference]: With dead ends: 869 [2025-01-09 06:05:52,388 INFO L226 Difference]: Without dead ends: 700 [2025-01-09 06:05:52,391 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:52,393 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1080 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:52,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1706 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:05:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-09 06:05:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 656. [2025-01-09 06:05:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 559 states have (on average 1.520572450805009) internal successors, (850), 568 states have internal predecessors, (850), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2025-01-09 06:05:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 987 transitions. [2025-01-09 06:05:52,459 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 987 transitions. Word has length 62 [2025-01-09 06:05:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:52,459 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 987 transitions. [2025-01-09 06:05:52,459 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:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 987 transitions. [2025-01-09 06:05:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:52,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:52,462 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:52,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:05:52,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:52,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1275391934, now seen corresponding path program 1 times [2025-01-09 06:05:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682148664] [2025-01-09 06:05:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:52,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:52,561 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:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682148664] [2025-01-09 06:05:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682148664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59781731] [2025-01-09 06:05:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:52,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:52,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:52,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:52,564 INFO L87 Difference]: Start difference. First operand 656 states and 987 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:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:52,624 INFO L93 Difference]: Finished difference Result 916 states and 1348 transitions. [2025-01-09 06:05:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:52,625 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:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:52,629 INFO L225 Difference]: With dead ends: 916 [2025-01-09 06:05:52,630 INFO L226 Difference]: Without dead ends: 661 [2025-01-09 06:05:52,631 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:52,632 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 0 mSDsluCounter, 2899 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3625 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:52,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3625 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:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-01-09 06:05:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-01-09 06:05:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 563 states have (on average 1.5133214920071048) internal successors, (852), 572 states have internal predecessors, (852), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2025-01-09 06:05:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 990 transitions. [2025-01-09 06:05:52,676 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 990 transitions. Word has length 62 [2025-01-09 06:05:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:52,676 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 990 transitions. [2025-01-09 06:05:52,677 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:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 990 transitions. [2025-01-09 06:05:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:52,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:52,679 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:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:05:52,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:52,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 431386432, now seen corresponding path program 1 times [2025-01-09 06:05:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869741935] [2025-01-09 06:05:52,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:52,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:52,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:52,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:52,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:52,763 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:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869741935] [2025-01-09 06:05:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869741935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:52,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106225809] [2025-01-09 06:05:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:52,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:52,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:52,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:52,765 INFO L87 Difference]: Start difference. First operand 661 states and 990 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:05:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:53,415 INFO L93 Difference]: Finished difference Result 2587 states and 3674 transitions. [2025-01-09 06:05:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:53,416 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), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-01-09 06:05:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:53,431 INFO L225 Difference]: With dead ends: 2587 [2025-01-09 06:05:53,431 INFO L226 Difference]: Without dead ends: 2327 [2025-01-09 06:05:53,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:05:53,434 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 1962 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:53,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1968 Valid, 2721 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2025-01-09 06:05:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2197. [2025-01-09 06:05:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2197 states, 1760 states have (on average 1.388068181818182) internal successors, (2443), 1797 states have internal predecessors, (2443), 229 states have call successors, (229), 173 states have call predecessors, (229), 206 states have return successors, (343), 230 states have call predecessors, (343), 225 states have call successors, (343) [2025-01-09 06:05:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 3015 transitions. [2025-01-09 06:05:53,594 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 3015 transitions. Word has length 62 [2025-01-09 06:05:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:53,594 INFO L471 AbstractCegarLoop]: Abstraction has 2197 states and 3015 transitions. [2025-01-09 06:05:53,595 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), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:05:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 3015 transitions. [2025-01-09 06:05:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:53,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:53,596 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:53,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:05:53,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:53,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1350361055, now seen corresponding path program 1 times [2025-01-09 06:05:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841353158] [2025-01-09 06:05:53,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:53,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:53,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:53,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:53,693 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,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841353158] [2025-01-09 06:05:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841353158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:53,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:53,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:53,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318443665] [2025-01-09 06:05:53,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:53,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:53,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:53,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:53,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:53,699 INFO L87 Difference]: Start difference. First operand 2197 states and 3015 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:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:53,882 INFO L93 Difference]: Finished difference Result 4038 states and 5506 transitions. [2025-01-09 06:05:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:53,883 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:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:53,897 INFO L225 Difference]: With dead ends: 4038 [2025-01-09 06:05:53,898 INFO L226 Difference]: Without dead ends: 2242 [2025-01-09 06:05:53,902 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:53,903 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 0 mSDsluCounter, 2899 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3625 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:53,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3625 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:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2025-01-09 06:05:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2025-01-09 06:05:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 1796 states have (on average 1.3719376391982183) internal successors, (2464), 1833 states have internal predecessors, (2464), 229 states have call successors, (229), 173 states have call predecessors, (229), 215 states have return successors, (361), 239 states have call predecessors, (361), 225 states have call successors, (361) [2025-01-09 06:05:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3054 transitions. [2025-01-09 06:05:54,023 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3054 transitions. Word has length 62 [2025-01-09 06:05:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:54,023 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3054 transitions. [2025-01-09 06:05:54,023 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:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3054 transitions. [2025-01-09 06:05:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:54,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:54,025 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:54,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:05:54,025 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:54,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1412400669, now seen corresponding path program 1 times [2025-01-09 06:05:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:54,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793572037] [2025-01-09 06:05:54,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:54,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:54,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:54,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:54,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:54,224 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:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793572037] [2025-01-09 06:05:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793572037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:54,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718630071] [2025-01-09 06:05:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:54,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:54,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:54,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:54,227 INFO L87 Difference]: Start difference. First operand 2242 states and 3054 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:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:55,090 INFO L93 Difference]: Finished difference Result 3938 states and 5243 transitions. [2025-01-09 06:05:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:05:55,091 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:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:55,106 INFO L225 Difference]: With dead ends: 3938 [2025-01-09 06:05:55,106 INFO L226 Difference]: Without dead ends: 2444 [2025-01-09 06:05:55,111 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:55,113 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1070 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:55,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1512 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2025-01-09 06:05:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2252. [2025-01-09 06:05:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 1808 states have (on average 1.3655973451327434) internal successors, (2469), 1840 states have internal predecessors, (2469), 230 states have call successors, (230), 174 states have call predecessors, (230), 212 states have return successors, (345), 241 states have call predecessors, (345), 226 states have call successors, (345) [2025-01-09 06:05:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3044 transitions. [2025-01-09 06:05:55,286 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3044 transitions. Word has length 62 [2025-01-09 06:05:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:55,287 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3044 transitions. [2025-01-09 06:05:55,287 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:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3044 transitions. [2025-01-09 06:05:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:55,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:55,289 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:55,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:05:55,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:55,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1835102495, now seen corresponding path program 1 times [2025-01-09 06:05:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082117633] [2025-01-09 06:05:55,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:55,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:55,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:55,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:55,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:55,384 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:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082117633] [2025-01-09 06:05:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082117633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:55,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:05:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109072465] [2025-01-09 06:05:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:55,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:05:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:55,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:05:55,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:05:55,386 INFO L87 Difference]: Start difference. First operand 2252 states and 3044 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:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:56,128 INFO L93 Difference]: Finished difference Result 5881 states and 7818 transitions. [2025-01-09 06:05:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:05:56,130 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:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:56,158 INFO L225 Difference]: With dead ends: 5881 [2025-01-09 06:05:56,159 INFO L226 Difference]: Without dead ends: 4033 [2025-01-09 06:05:56,165 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:56,166 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1026 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:56,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 769 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2025-01-09 06:05:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4029. [2025-01-09 06:05:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4029 states, 3172 states have (on average 1.3130517023959647) internal successors, (4165), 3234 states have internal predecessors, (4165), 432 states have call successors, (432), 340 states have call predecessors, (432), 423 states have return successors, (723), 461 states have call predecessors, (723), 428 states have call successors, (723) [2025-01-09 06:05:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 5320 transitions. [2025-01-09 06:05:56,413 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 5320 transitions. Word has length 62 [2025-01-09 06:05:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:56,414 INFO L471 AbstractCegarLoop]: Abstraction has 4029 states and 5320 transitions. [2025-01-09 06:05:56,414 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:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 5320 transitions. [2025-01-09 06:05:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:05:56,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:56,416 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:56,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:05:56,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:56,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash -710720873, now seen corresponding path program 1 times [2025-01-09 06:05:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713184718] [2025-01-09 06:05:56,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:56,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:05:56,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:05:56,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:56,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:56,480 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:56,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:56,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713184718] [2025-01-09 06:05:56,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713184718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:56,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:56,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:56,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564090647] [2025-01-09 06:05:56,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:56,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:56,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:56,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:56,482 INFO L87 Difference]: Start difference. First operand 4029 states and 5320 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:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:56,819 INFO L93 Difference]: Finished difference Result 10006 states and 13186 transitions. [2025-01-09 06:05:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:56,820 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:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:56,865 INFO L225 Difference]: With dead ends: 10006 [2025-01-09 06:05:56,865 INFO L226 Difference]: Without dead ends: 6360 [2025-01-09 06:05:56,881 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:56,882 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 102 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:56,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1434 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:05:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2025-01-09 06:05:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 6226. [2025-01-09 06:05:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6226 states, 4831 states have (on average 1.2951769819913062) internal successors, (6257), 4910 states have internal predecessors, (6257), 693 states have call successors, (693), 572 states have call predecessors, (693), 700 states have return successors, (1177), 750 states have call predecessors, (1177), 689 states have call successors, (1177) [2025-01-09 06:05:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 8127 transitions. [2025-01-09 06:05:57,423 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 8127 transitions. Word has length 63 [2025-01-09 06:05:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:57,424 INFO L471 AbstractCegarLoop]: Abstraction has 6226 states and 8127 transitions. [2025-01-09 06:05:57,424 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:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 8127 transitions. [2025-01-09 06:05:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:05:57,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:57,428 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:57,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:05:57,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:57,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -763537685, now seen corresponding path program 1 times [2025-01-09 06:05:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071778610] [2025-01-09 06:05:57,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:57,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:05:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:05:57,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:57,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:57,542 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:57,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:57,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071778610] [2025-01-09 06:05:57,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071778610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:57,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:57,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:05:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867971124] [2025-01-09 06:05:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:57,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:05:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:57,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:05:57,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:05:57,545 INFO L87 Difference]: Start difference. First operand 6226 states and 8127 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:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:58,087 INFO L93 Difference]: Finished difference Result 7344 states and 9506 transitions. [2025-01-09 06:05:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:58,087 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:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:58,124 INFO L225 Difference]: With dead ends: 7344 [2025-01-09 06:05:58,128 INFO L226 Difference]: Without dead ends: 7341 [2025-01-09 06:05:58,132 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:58,133 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1361 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:58,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 825 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:05:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2025-01-09 06:05:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 7242. [2025-01-09 06:05:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 5596 states have (on average 1.2846676197283775) internal successors, (7189), 5684 states have internal predecessors, (7189), 819 states have call successors, (819), 686 states have call predecessors, (819), 825 states have return successors, (1370), 878 states have call predecessors, (1370), 816 states have call successors, (1370) [2025-01-09 06:05:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 9378 transitions. [2025-01-09 06:05:58,600 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 9378 transitions. Word has length 68 [2025-01-09 06:05:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:58,602 INFO L471 AbstractCegarLoop]: Abstraction has 7242 states and 9378 transitions. [2025-01-09 06:05:58,603 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:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 9378 transitions. [2025-01-09 06:05:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:05:58,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:58,607 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:58,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:05:58,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:58,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2098759418, now seen corresponding path program 1 times [2025-01-09 06:05:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:58,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435722543] [2025-01-09 06:05:58,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:58,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:05:58,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:05:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:58,741 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:58,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435722543] [2025-01-09 06:05:58,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435722543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768583911] [2025-01-09 06:05:58,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:58,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:58,748 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:58,756 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:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:05:58,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:05:58,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:58,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:58,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:05:58,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:59,131 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:59,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:05:59,212 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:59,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768583911] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:05:59,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:05:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:05:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698779202] [2025-01-09 06:05:59,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:05:59,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:05:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:59,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:05:59,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:59,214 INFO L87 Difference]: Start difference. First operand 7242 states and 9378 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:06:00,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:00,607 INFO L93 Difference]: Finished difference Result 15118 states and 19351 transitions. [2025-01-09 06:06:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:06:00,608 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:06:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:00,702 INFO L225 Difference]: With dead ends: 15118 [2025-01-09 06:06:00,702 INFO L226 Difference]: Without dead ends: 15115 [2025-01-09 06:06:00,714 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:06:00,715 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 1020 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 3428 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:00,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 3428 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2025-01-09 06:06:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 13805. [2025-01-09 06:06:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13805 states, 10635 states have (on average 1.2740949694405266) internal successors, (13550), 10803 states have internal predecessors, (13550), 1551 states have call successors, (1551), 1320 states have call predecessors, (1551), 1617 states have return successors, (2637), 1688 states have call predecessors, (2637), 1548 states have call successors, (2637) [2025-01-09 06:06:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13805 states to 13805 states and 17738 transitions. [2025-01-09 06:06:02,061 INFO L78 Accepts]: Start accepts. Automaton has 13805 states and 17738 transitions. Word has length 69 [2025-01-09 06:06:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:02,062 INFO L471 AbstractCegarLoop]: Abstraction has 13805 states and 17738 transitions. [2025-01-09 06:06:02,062 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:06:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13805 states and 17738 transitions. [2025-01-09 06:06:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:06:02,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:02,065 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:06:02,075 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:06:02,266 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,SelfDestructingSolverStorable9 [2025-01-09 06:06:02,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1852719944, now seen corresponding path program 2 times [2025-01-09 06:06:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561467689] [2025-01-09 06:06:02,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:06:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:02,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:06:02,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:06:02,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:06:02,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:02,308 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:06:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561467689] [2025-01-09 06:06:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561467689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016571222] [2025-01-09 06:06:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:02,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:02,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:02,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:02,310 INFO L87 Difference]: Start difference. First operand 13805 states and 17738 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:06:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:02,869 INFO L93 Difference]: Finished difference Result 20531 states and 26427 transitions. [2025-01-09 06:06:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:02,870 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:06:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:02,923 INFO L225 Difference]: With dead ends: 20531 [2025-01-09 06:06:02,923 INFO L226 Difference]: Without dead ends: 7955 [2025-01-09 06:06:02,962 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:06:02,964 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 698 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 915 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:06:02,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 915 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7955 states. [2025-01-09 06:06:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7955 to 7857. [2025-01-09 06:06:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7857 states, 6088 states have (on average 1.2547634691195795) internal successors, (7639), 6170 states have internal predecessors, (7639), 885 states have call successors, (885), 742 states have call predecessors, (885), 882 states have return successors, (1383), 951 states have call predecessors, (1383), 882 states have call successors, (1383) [2025-01-09 06:06:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 9907 transitions. [2025-01-09 06:06:03,578 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 9907 transitions. Word has length 71 [2025-01-09 06:06:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:03,579 INFO L471 AbstractCegarLoop]: Abstraction has 7857 states and 9907 transitions. [2025-01-09 06:06:03,579 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:06:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 9907 transitions. [2025-01-09 06:06:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:06:03,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:03,583 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:06:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:06:03,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash 430236367, now seen corresponding path program 1 times [2025-01-09 06:06:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321648146] [2025-01-09 06:06:03,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:03,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:06:03,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:06:03,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:03,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:03,691 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:06:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321648146] [2025-01-09 06:06:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321648146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42234155] [2025-01-09 06:06:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:03,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:03,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:03,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:03,693 INFO L87 Difference]: Start difference. First operand 7857 states and 9907 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:06:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:05,849 INFO L93 Difference]: Finished difference Result 22859 states and 28710 transitions. [2025-01-09 06:06:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:06:05,849 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:06:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:05,928 INFO L225 Difference]: With dead ends: 22859 [2025-01-09 06:06:05,928 INFO L226 Difference]: Without dead ends: 15409 [2025-01-09 06:06:05,953 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:06:05,954 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 759 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:05,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 2013 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 06:06:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15409 states. [2025-01-09 06:06:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15409 to 14766. [2025-01-09 06:06:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14766 states, 11306 states have (on average 1.2199716964443659) internal successors, (13793), 11496 states have internal predecessors, (13793), 1704 states have call successors, (1704), 1442 states have call predecessors, (1704), 1754 states have return successors, (2896), 1840 states have call predecessors, (2896), 1701 states have call successors, (2896) [2025-01-09 06:06:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14766 states to 14766 states and 18393 transitions. [2025-01-09 06:06:07,076 INFO L78 Accepts]: Start accepts. Automaton has 14766 states and 18393 transitions. Word has length 80 [2025-01-09 06:06:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:07,077 INFO L471 AbstractCegarLoop]: Abstraction has 14766 states and 18393 transitions. [2025-01-09 06:06:07,077 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:06:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 14766 states and 18393 transitions. [2025-01-09 06:06:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:06:07,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:07,083 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:06:07,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:06:07,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:07,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -73180913, now seen corresponding path program 1 times [2025-01-09 06:06:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:07,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804755709] [2025-01-09 06:06:07,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:07,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:06:07,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:06:07,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:07,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:07,192 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:06:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804755709] [2025-01-09 06:06:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804755709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:06:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723260874] [2025-01-09 06:06:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:07,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:06:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:07,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:06:07,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:07,194 INFO L87 Difference]: Start difference. First operand 14766 states and 18393 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:06:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:08,753 INFO L93 Difference]: Finished difference Result 26340 states and 32720 transitions. [2025-01-09 06:06:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:06:08,754 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:06:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:08,815 INFO L225 Difference]: With dead ends: 26340 [2025-01-09 06:06:08,815 INFO L226 Difference]: Without dead ends: 12590 [2025-01-09 06:06:08,851 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:06:08,852 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1658 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:08,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 2081 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:06:08,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12590 states. [2025-01-09 06:06:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12590 to 11862. [2025-01-09 06:06:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11862 states, 9140 states have (on average 1.2132385120350109) internal successors, (11089), 9284 states have internal predecessors, (11089), 1333 states have call successors, (1333), 1123 states have call predecessors, (1333), 1387 states have return successors, (2088), 1464 states have call predecessors, (2088), 1330 states have call successors, (2088) [2025-01-09 06:06:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11862 states to 11862 states and 14510 transitions. [2025-01-09 06:06:09,582 INFO L78 Accepts]: Start accepts. Automaton has 11862 states and 14510 transitions. Word has length 86 [2025-01-09 06:06:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:09,583 INFO L471 AbstractCegarLoop]: Abstraction has 11862 states and 14510 transitions. [2025-01-09 06:06:09,583 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:06:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 11862 states and 14510 transitions. [2025-01-09 06:06:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 06:06:09,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:09,598 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:06:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:06:09,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:09,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1582390344, now seen corresponding path program 1 times [2025-01-09 06:06:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726249063] [2025-01-09 06:06:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:09,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 06:06:09,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 06:06:09,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:09,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:09,710 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:06:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726249063] [2025-01-09 06:06:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726249063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:06:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284014851] [2025-01-09 06:06:09,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:09,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:09,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:09,712 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:06:09,714 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:06:09,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 06:06:09,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 06:06:09,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:09,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:09,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 06:06:09,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:06:09,874 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:06:09,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:06:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284014851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:06:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-09 06:06:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104866242] [2025-01-09 06:06:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:09,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:09,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:06:09,879 INFO L87 Difference]: Start difference. First operand 11862 states and 14510 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:06:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:10,156 INFO L93 Difference]: Finished difference Result 16941 states and 20640 transitions. [2025-01-09 06:06:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:10,157 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:06:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:10,193 INFO L225 Difference]: With dead ends: 16941 [2025-01-09 06:06:10,194 INFO L226 Difference]: Without dead ends: 5494 [2025-01-09 06:06:10,266 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:06:10,267 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 0 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3611 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:06:10,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3611 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2025-01-09 06:06:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 5306. [2025-01-09 06:06:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5306 states, 4196 states have (on average 1.2178265014299332) internal successors, (5110), 4241 states have internal predecessors, (5110), 543 states have call successors, (543), 434 states have call predecessors, (543), 565 states have return successors, (837), 631 states have call predecessors, (837), 540 states have call successors, (837) [2025-01-09 06:06:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5306 states to 5306 states and 6490 transitions. [2025-01-09 06:06:10,536 INFO L78 Accepts]: Start accepts. Automaton has 5306 states and 6490 transitions. Word has length 139 [2025-01-09 06:06:10,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:10,537 INFO L471 AbstractCegarLoop]: Abstraction has 5306 states and 6490 transitions. [2025-01-09 06:06:10,537 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:06:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 5306 states and 6490 transitions. [2025-01-09 06:06:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 06:06:10,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:10,544 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:06:10,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 06:06:10,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:10,745 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2047858442, now seen corresponding path program 1 times [2025-01-09 06:06:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:10,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092229080] [2025-01-09 06:06:10,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:10,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 06:06:10,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 06:06:10,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:10,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:10,780 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:06:10,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:10,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092229080] [2025-01-09 06:06:10,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092229080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:10,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:10,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:10,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731491540] [2025-01-09 06:06:10,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:10,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:10,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:10,781 INFO L87 Difference]: Start difference. First operand 5306 states and 6490 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:06:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:10,945 INFO L93 Difference]: Finished difference Result 5619 states and 6856 transitions. [2025-01-09 06:06:10,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:10,946 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:06:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:10,967 INFO L225 Difference]: With dead ends: 5619 [2025-01-09 06:06:10,968 INFO L226 Difference]: Without dead ends: 4898 [2025-01-09 06:06:10,972 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:06:10,972 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 120 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1326 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:06:10,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1326 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2025-01-09 06:06:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 4898. [2025-01-09 06:06:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4898 states, 3884 states have (on average 1.222193614830072) internal successors, (4747), 3926 states have internal predecessors, (4747), 497 states have call successors, (497), 394 states have call predecessors, (497), 515 states have return successors, (774), 578 states have call predecessors, (774), 494 states have call successors, (774) [2025-01-09 06:06:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4898 states to 4898 states and 6018 transitions. [2025-01-09 06:06:11,197 INFO L78 Accepts]: Start accepts. Automaton has 4898 states and 6018 transitions. Word has length 141 [2025-01-09 06:06:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:11,198 INFO L471 AbstractCegarLoop]: Abstraction has 4898 states and 6018 transitions. [2025-01-09 06:06:11,198 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:06:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4898 states and 6018 transitions. [2025-01-09 06:06:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 06:06:11,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:11,204 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:06:11,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:06:11,204 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:11,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1020833497, now seen corresponding path program 1 times [2025-01-09 06:06:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:11,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017979230] [2025-01-09 06:06:11,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:11,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 06:06:11,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 06:06:11,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:11,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:11,284 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:06:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017979230] [2025-01-09 06:06:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017979230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:11,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505428218] [2025-01-09 06:06:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:11,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:11,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:11,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:11,286 INFO L87 Difference]: Start difference. First operand 4898 states and 6018 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:06:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:12,150 INFO L93 Difference]: Finished difference Result 8978 states and 10948 transitions. [2025-01-09 06:06:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:12,150 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:06:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:12,170 INFO L225 Difference]: With dead ends: 8978 [2025-01-09 06:06:12,170 INFO L226 Difference]: Without dead ends: 4850 [2025-01-09 06:06:12,178 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:06:12,179 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 362 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:12,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1492 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2025-01-09 06:06:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4615. [2025-01-09 06:06:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 3668 states have (on average 1.2273718647764449) internal successors, (4502), 3719 states have internal predecessors, (4502), 463 states have call successors, (463), 368 states have call predecessors, (463), 482 states have return successors, (719), 528 states have call predecessors, (719), 460 states have call successors, (719) [2025-01-09 06:06:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 5684 transitions. [2025-01-09 06:06:12,566 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 5684 transitions. Word has length 150 [2025-01-09 06:06:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:12,567 INFO L471 AbstractCegarLoop]: Abstraction has 4615 states and 5684 transitions. [2025-01-09 06:06:12,567 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:06:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 5684 transitions. [2025-01-09 06:06:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 06:06:12,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:12,574 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:06:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:06:12,574 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:12,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1267356435, now seen corresponding path program 1 times [2025-01-09 06:06:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133830806] [2025-01-09 06:06:12,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:12,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 06:06:12,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 06:06:12,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:12,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:12,796 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:06:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133830806] [2025-01-09 06:06:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133830806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:06:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237654488] [2025-01-09 06:06:12,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:12,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:12,801 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:06:12,804 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:06:12,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 06:06:12,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 06:06:12,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:12,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:12,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 06:06:12,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:06:13,062 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:06:13,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:06:13,283 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:06:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237654488] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:06:13,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:06:13,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-01-09 06:06:13,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487114240] [2025-01-09 06:06:13,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:06:13,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 06:06:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:13,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 06:06:13,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:06:13,286 INFO L87 Difference]: Start difference. First operand 4615 states and 5684 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:06:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:15,084 INFO L93 Difference]: Finished difference Result 12207 states and 15410 transitions. [2025-01-09 06:06:15,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 06:06:15,085 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:06:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:15,113 INFO L225 Difference]: With dead ends: 12207 [2025-01-09 06:06:15,114 INFO L226 Difference]: Without dead ends: 6470 [2025-01-09 06:06:15,125 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:06:15,125 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1707 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:15,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 1520 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 06:06:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6470 states. [2025-01-09 06:06:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6470 to 5315. [2025-01-09 06:06:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5315 states, 4145 states have (on average 1.2065138721351025) internal successors, (5001), 4223 states have internal predecessors, (5001), 565 states have call successors, (565), 462 states have call predecessors, (565), 603 states have return successors, (1018), 630 states have call predecessors, (1018), 562 states have call successors, (1018) [2025-01-09 06:06:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 6584 transitions. [2025-01-09 06:06:15,464 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 6584 transitions. Word has length 153 [2025-01-09 06:06:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:15,465 INFO L471 AbstractCegarLoop]: Abstraction has 5315 states and 6584 transitions. [2025-01-09 06:06:15,465 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:06:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 6584 transitions. [2025-01-09 06:06:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 06:06:15,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:15,470 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:15,477 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:06:15,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:15,670 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash -596195117, now seen corresponding path program 1 times [2025-01-09 06:06:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576372898] [2025-01-09 06:06:15,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:15,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 06:06:15,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 06:06:15,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:15,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 06:06:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:15,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576372898] [2025-01-09 06:06:15,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576372898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:06:15,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792180778] [2025-01-09 06:06:15,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:15,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:06:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:15,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:06:15,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 06:06:15,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 06:06:15,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 06:06:15,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:15,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:15,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 06:06:15,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:06:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 06:06:15,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:06:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792180778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:15,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:06:15,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-09 06:06:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306616987] [2025-01-09 06:06:15,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:15,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:15,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:15,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:15,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:06:15,927 INFO L87 Difference]: Start difference. First operand 5315 states and 6584 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 06:06:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:16,554 INFO L93 Difference]: Finished difference Result 6917 states and 8466 transitions. [2025-01-09 06:06:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:06:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 169 [2025-01-09 06:06:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:16,570 INFO L225 Difference]: With dead ends: 6917 [2025-01-09 06:06:16,571 INFO L226 Difference]: Without dead ends: 1818 [2025-01-09 06:06:16,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:06:16,578 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 989 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:16,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 1070 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2025-01-09 06:06:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1745. [2025-01-09 06:06:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1413 states have (on average 1.2476999292285917) internal successors, (1763), 1428 states have internal predecessors, (1763), 173 states have call successors, (173), 131 states have call predecessors, (173), 157 states have return successors, (240), 186 states have call predecessors, (240), 170 states have call successors, (240) [2025-01-09 06:06:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2176 transitions. [2025-01-09 06:06:16,686 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2176 transitions. Word has length 169 [2025-01-09 06:06:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:16,687 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2176 transitions. [2025-01-09 06:06:16,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 06:06:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2176 transitions. [2025-01-09 06:06:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:16,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:16,689 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, 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:06:16,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 06:06:16,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 06:06:16,889 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash 686342788, now seen corresponding path program 1 times [2025-01-09 06:06:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941571197] [2025-01-09 06:06:16,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:16,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:16,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:16,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:16,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:16,940 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:06:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941571197] [2025-01-09 06:06:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941571197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:16,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:16,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:16,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106882318] [2025-01-09 06:06:16,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:16,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:16,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:16,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:16,941 INFO L87 Difference]: Start difference. First operand 1745 states and 2176 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:06:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:17,022 INFO L93 Difference]: Finished difference Result 2112 states and 2755 transitions. [2025-01-09 06:06:17,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:17,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:17,038 INFO L225 Difference]: With dead ends: 2112 [2025-01-09 06:06:17,038 INFO L226 Difference]: Without dead ends: 1745 [2025-01-09 06:06:17,039 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:06:17,040 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 588 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 847 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:06:17,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 847 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-01-09 06:06:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2025-01-09 06:06:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1413 states have (on average 1.2469922151450814) internal successors, (1762), 1428 states have internal predecessors, (1762), 173 states have call successors, (173), 131 states have call predecessors, (173), 157 states have return successors, (240), 186 states have call predecessors, (240), 170 states have call successors, (240) [2025-01-09 06:06:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2175 transitions. [2025-01-09 06:06:17,139 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2175 transitions. Word has length 177 [2025-01-09 06:06:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:17,139 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2175 transitions. [2025-01-09 06:06:17,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:06:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2175 transitions. [2025-01-09 06:06:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:17,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:17,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:17,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:06:17,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:17,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:17,143 INFO L85 PathProgramCache]: Analyzing trace with hash 116070982, now seen corresponding path program 1 times [2025-01-09 06:06:17,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:17,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230698067] [2025-01-09 06:06:17,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:17,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:17,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:17,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:17,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:17,216 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:06:17,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:17,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230698067] [2025-01-09 06:06:17,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230698067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:17,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:17,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326632822] [2025-01-09 06:06:17,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:17,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:17,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:17,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:17,217 INFO L87 Difference]: Start difference. First operand 1745 states and 2175 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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:06:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:17,844 INFO L93 Difference]: Finished difference Result 2513 states and 3405 transitions. [2025-01-09 06:06:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:17,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:17,861 INFO L225 Difference]: With dead ends: 2513 [2025-01-09 06:06:17,861 INFO L226 Difference]: Without dead ends: 2153 [2025-01-09 06:06:17,862 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:06:17,865 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1319 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:17,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1810 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-01-09 06:06:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2122. [2025-01-09 06:06:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 1762 states have (on average 1.3178206583427923) internal successors, (2322), 1778 states have internal predecessors, (2322), 194 states have call successors, (194), 137 states have call predecessors, (194), 164 states have return successors, (262), 207 states have call predecessors, (262), 191 states have call successors, (262) [2025-01-09 06:06:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 2778 transitions. [2025-01-09 06:06:17,988 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 2778 transitions. Word has length 177 [2025-01-09 06:06:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:17,989 INFO L471 AbstractCegarLoop]: Abstraction has 2122 states and 2778 transitions. [2025-01-09 06:06:17,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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:06:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 2778 transitions. [2025-01-09 06:06:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:17,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:17,991 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, 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:06:17,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:06:17,991 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1750381378, now seen corresponding path program 1 times [2025-01-09 06:06:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214627827] [2025-01-09 06:06:17,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:18,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:18,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:18,098 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:06:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214627827] [2025-01-09 06:06:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214627827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:18,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:18,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:18,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635372859] [2025-01-09 06:06:18,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:18,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:18,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:18,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:18,100 INFO L87 Difference]: Start difference. First operand 2122 states and 2778 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:18,968 INFO L93 Difference]: Finished difference Result 3339 states and 4746 transitions. [2025-01-09 06:06:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:18,983 INFO L225 Difference]: With dead ends: 3339 [2025-01-09 06:06:18,984 INFO L226 Difference]: Without dead ends: 2602 [2025-01-09 06:06:18,985 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:06:18,986 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 1355 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:18,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 2555 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2025-01-09 06:06:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2471. [2025-01-09 06:06:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2083 states have (on average 1.356697071531445) internal successors, (2826), 2100 states have internal predecessors, (2826), 215 states have call successors, (215), 143 states have call predecessors, (215), 171 states have return successors, (286), 229 states have call predecessors, (286), 212 states have call successors, (286) [2025-01-09 06:06:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3327 transitions. [2025-01-09 06:06:19,120 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3327 transitions. Word has length 177 [2025-01-09 06:06:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3327 transitions. [2025-01-09 06:06:19,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3327 transitions. [2025-01-09 06:06:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:19,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:19,122 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, 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:06:19,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:06:19,122 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:19,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash -650252032, now seen corresponding path program 1 times [2025-01-09 06:06:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80498942] [2025-01-09 06:06:19,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:19,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:19,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:19,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:19,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:19,227 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:06:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80498942] [2025-01-09 06:06:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80498942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885784254] [2025-01-09 06:06:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:19,230 INFO L87 Difference]: Start difference. First operand 2471 states and 3327 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:19,733 INFO L93 Difference]: Finished difference Result 3677 states and 5282 transitions. [2025-01-09 06:06:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:19,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:19,754 INFO L225 Difference]: With dead ends: 3677 [2025-01-09 06:06:19,755 INFO L226 Difference]: Without dead ends: 2591 [2025-01-09 06:06:19,758 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:06:19,760 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 978 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:19,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 1349 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-01-09 06:06:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2471. [2025-01-09 06:06:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2083 states have (on average 1.3552568410945751) internal successors, (2823), 2100 states have internal predecessors, (2823), 215 states have call successors, (215), 143 states have call predecessors, (215), 171 states have return successors, (286), 229 states have call predecessors, (286), 212 states have call successors, (286) [2025-01-09 06:06:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3324 transitions. [2025-01-09 06:06:19,978 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3324 transitions. Word has length 177 [2025-01-09 06:06:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:19,978 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3324 transitions. [2025-01-09 06:06:19,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3324 transitions. [2025-01-09 06:06:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:19,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:19,981 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, 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:06:19,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:06:19,981 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 796328834, now seen corresponding path program 1 times [2025-01-09 06:06:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116708936] [2025-01-09 06:06:19,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:19,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:19,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:19,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:19,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:20,058 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:06:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116708936] [2025-01-09 06:06:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116708936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688705470] [2025-01-09 06:06:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:20,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:20,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:20,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:20,059 INFO L87 Difference]: Start difference. First operand 2471 states and 3324 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:20,542 INFO L93 Difference]: Finished difference Result 3672 states and 5266 transitions. [2025-01-09 06:06:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:20,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:20,561 INFO L225 Difference]: With dead ends: 3672 [2025-01-09 06:06:20,562 INFO L226 Difference]: Without dead ends: 2586 [2025-01-09 06:06:20,565 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:06:20,565 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 975 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:20,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1341 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2025-01-09 06:06:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2471. [2025-01-09 06:06:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2083 states have (on average 1.3538166106577052) internal successors, (2820), 2100 states have internal predecessors, (2820), 215 states have call successors, (215), 143 states have call predecessors, (215), 171 states have return successors, (286), 229 states have call predecessors, (286), 212 states have call successors, (286) [2025-01-09 06:06:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3321 transitions. [2025-01-09 06:06:20,716 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3321 transitions. Word has length 177 [2025-01-09 06:06:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:20,716 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3321 transitions. [2025-01-09 06:06:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3321 transitions. [2025-01-09 06:06:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:20,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:20,718 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, 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:06:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:06:20,718 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash -126838592, now seen corresponding path program 1 times [2025-01-09 06:06:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72711184] [2025-01-09 06:06:20,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:20,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:20,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:20,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:20,826 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:06:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72711184] [2025-01-09 06:06:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72711184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:20,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530977906] [2025-01-09 06:06:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:20,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:20,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:20,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:20,828 INFO L87 Difference]: Start difference. First operand 2471 states and 3321 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:21,744 INFO L93 Difference]: Finished difference Result 4437 states and 6476 transitions. [2025-01-09 06:06:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:21,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:21,772 INFO L225 Difference]: With dead ends: 4437 [2025-01-09 06:06:21,772 INFO L226 Difference]: Without dead ends: 3351 [2025-01-09 06:06:21,776 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:06:21,777 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 1304 mSDsluCounter, 2507 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:21,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 3336 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:06:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2025-01-09 06:06:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3210. [2025-01-09 06:06:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 2764 states have (on average 1.4106367583212736) internal successors, (3899), 2785 states have internal predecessors, (3899), 257 states have call successors, (257), 155 states have call predecessors, (257), 187 states have return successors, (340), 273 states have call predecessors, (340), 254 states have call successors, (340) [2025-01-09 06:06:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 4496 transitions. [2025-01-09 06:06:22,076 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 4496 transitions. Word has length 177 [2025-01-09 06:06:22,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:22,076 INFO L471 AbstractCegarLoop]: Abstraction has 3210 states and 4496 transitions. [2025-01-09 06:06:22,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 4496 transitions. [2025-01-09 06:06:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:22,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:22,079 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, 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:06:22,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:06:22,080 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:22,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash 259023810, now seen corresponding path program 1 times [2025-01-09 06:06:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:22,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188122864] [2025-01-09 06:06:22,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:22,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:22,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:22,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:22,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:22,166 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:06:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188122864] [2025-01-09 06:06:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188122864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:22,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087446350] [2025-01-09 06:06:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:22,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:22,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:22,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:22,167 INFO L87 Difference]: Start difference. First operand 3210 states and 4496 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:22,714 INFO L93 Difference]: Finished difference Result 5266 states and 7840 transitions. [2025-01-09 06:06:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:22,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:22,735 INFO L225 Difference]: With dead ends: 5266 [2025-01-09 06:06:22,735 INFO L226 Difference]: Without dead ends: 3441 [2025-01-09 06:06:22,739 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:06:22,739 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 971 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:22,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1327 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2025-01-09 06:06:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3210. [2025-01-09 06:06:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 2764 states have (on average 1.4088277858176557) internal successors, (3894), 2785 states have internal predecessors, (3894), 257 states have call successors, (257), 155 states have call predecessors, (257), 187 states have return successors, (340), 273 states have call predecessors, (340), 254 states have call successors, (340) [2025-01-09 06:06:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 4491 transitions. [2025-01-09 06:06:22,933 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 4491 transitions. Word has length 177 [2025-01-09 06:06:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:22,933 INFO L471 AbstractCegarLoop]: Abstraction has 3210 states and 4491 transitions. [2025-01-09 06:06:22,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 4491 transitions. [2025-01-09 06:06:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:22,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:22,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:06:22,936 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash -5623680, now seen corresponding path program 1 times [2025-01-09 06:06:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99163163] [2025-01-09 06:06:22,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:22,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:22,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:22,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:22,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:23,036 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:06:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99163163] [2025-01-09 06:06:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99163163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:23,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446863622] [2025-01-09 06:06:23,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:23,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:23,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:23,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:23,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:23,038 INFO L87 Difference]: Start difference. First operand 3210 states and 4491 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:24,001 INFO L93 Difference]: Finished difference Result 6798 states and 10278 transitions. [2025-01-09 06:06:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:24,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:24,035 INFO L225 Difference]: With dead ends: 6798 [2025-01-09 06:06:24,035 INFO L226 Difference]: Without dead ends: 4973 [2025-01-09 06:06:24,041 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:06:24,042 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 1291 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:24,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 3305 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:06:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2025-01-09 06:06:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4802. [2025-01-09 06:06:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4234 states have (on average 1.4775625885687294) internal successors, (6256), 4269 states have internal predecessors, (6256), 341 states have call successors, (341), 179 states have call predecessors, (341), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:06:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7069 transitions. [2025-01-09 06:06:24,395 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 7069 transitions. Word has length 177 [2025-01-09 06:06:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:24,395 INFO L471 AbstractCegarLoop]: Abstraction has 4802 states and 7069 transitions. [2025-01-09 06:06:24,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7069 transitions. [2025-01-09 06:06:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:24,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:24,398 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, 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:06:24,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:06:24,398 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:24,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1925501954, now seen corresponding path program 1 times [2025-01-09 06:06:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475799199] [2025-01-09 06:06:24,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:24,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:24,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:24,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:24,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:24,498 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:06:24,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:24,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475799199] [2025-01-09 06:06:24,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475799199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:24,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:24,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:24,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108024839] [2025-01-09 06:06:24,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:24,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:24,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:24,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:24,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:24,500 INFO L87 Difference]: Start difference. First operand 4802 states and 7069 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:25,162 INFO L93 Difference]: Finished difference Result 8770 states and 13628 transitions. [2025-01-09 06:06:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:25,182 INFO L225 Difference]: With dead ends: 8770 [2025-01-09 06:06:25,183 INFO L226 Difference]: Without dead ends: 5353 [2025-01-09 06:06:25,189 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:06:25,190 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 967 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:25,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1313 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-01-09 06:06:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 4802. [2025-01-09 06:06:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4234 states have (on average 1.4754369390647142) internal successors, (6247), 4269 states have internal predecessors, (6247), 341 states have call successors, (341), 179 states have call predecessors, (341), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:06:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7060 transitions. [2025-01-09 06:06:25,463 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 7060 transitions. Word has length 177 [2025-01-09 06:06:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:25,463 INFO L471 AbstractCegarLoop]: Abstraction has 4802 states and 7060 transitions. [2025-01-09 06:06:25,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7060 transitions. [2025-01-09 06:06:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:25,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:25,466 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, 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:06:25,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:06:25,466 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:25,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 602323008, now seen corresponding path program 1 times [2025-01-09 06:06:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:25,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729106414] [2025-01-09 06:06:25,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:25,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:25,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:25,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:25,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:25,550 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:06:25,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:25,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729106414] [2025-01-09 06:06:25,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729106414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:25,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:25,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217649723] [2025-01-09 06:06:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:25,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:25,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:25,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:25,553 INFO L87 Difference]: Start difference. First operand 4802 states and 7060 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:26,147 INFO L93 Difference]: Finished difference Result 8712 states and 13494 transitions. [2025-01-09 06:06:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:26,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:26,168 INFO L225 Difference]: With dead ends: 8712 [2025-01-09 06:06:26,168 INFO L226 Difference]: Without dead ends: 5295 [2025-01-09 06:06:26,175 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:06:26,176 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 994 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:26,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1233 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2025-01-09 06:06:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 4802. [2025-01-09 06:06:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4234 states have (on average 1.473311289560699) internal successors, (6238), 4269 states have internal predecessors, (6238), 341 states have call successors, (341), 179 states have call predecessors, (341), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:06:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7051 transitions. [2025-01-09 06:06:26,468 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 7051 transitions. Word has length 177 [2025-01-09 06:06:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:26,468 INFO L471 AbstractCegarLoop]: Abstraction has 4802 states and 7051 transitions. [2025-01-09 06:06:26,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7051 transitions. [2025-01-09 06:06:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:26,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:26,471 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, 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:06:26,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 06:06:26,471 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:26,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash 940610558, now seen corresponding path program 1 times [2025-01-09 06:06:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:26,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185871290] [2025-01-09 06:06:26,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:26,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:26,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:26,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:26,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:26,536 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:06:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185871290] [2025-01-09 06:06:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185871290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358338370] [2025-01-09 06:06:26,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:26,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:26,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:26,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:26,537 INFO L87 Difference]: Start difference. First operand 4802 states and 7051 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:27,076 INFO L93 Difference]: Finished difference Result 8683 states and 13418 transitions. [2025-01-09 06:06:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:27,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:27,095 INFO L225 Difference]: With dead ends: 8683 [2025-01-09 06:06:27,096 INFO L226 Difference]: Without dead ends: 5266 [2025-01-09 06:06:27,102 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:06:27,102 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 960 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:27,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1291 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2025-01-09 06:06:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 4802. [2025-01-09 06:06:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4234 states have (on average 1.471185640056684) internal successors, (6229), 4269 states have internal predecessors, (6229), 341 states have call successors, (341), 179 states have call predecessors, (341), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:06:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7042 transitions. [2025-01-09 06:06:27,372 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 7042 transitions. Word has length 177 [2025-01-09 06:06:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:27,373 INFO L471 AbstractCegarLoop]: Abstraction has 4802 states and 7042 transitions. [2025-01-09 06:06:27,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7042 transitions. [2025-01-09 06:06:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:27,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:27,375 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, 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:06:27,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 06:06:27,375 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1367165056, now seen corresponding path program 1 times [2025-01-09 06:06:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:27,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009149677] [2025-01-09 06:06:27,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:27,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:27,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:27,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:27,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:27,453 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:06:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:27,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009149677] [2025-01-09 06:06:27,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009149677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:27,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:27,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497994886] [2025-01-09 06:06:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:27,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:27,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:27,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:27,455 INFO L87 Difference]: Start difference. First operand 4802 states and 7042 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:28,470 INFO L93 Difference]: Finished difference Result 11824 states and 18469 transitions. [2025-01-09 06:06:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:28,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:28,494 INFO L225 Difference]: With dead ends: 11824 [2025-01-09 06:06:28,494 INFO L226 Difference]: Without dead ends: 8407 [2025-01-09 06:06:28,500 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:06:28,501 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1259 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3222 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:28,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3222 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8407 states. [2025-01-09 06:06:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8407 to 8211. [2025-01-09 06:06:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8211 states, 7381 states have (on average 1.5338030077225309) internal successors, (11321), 7462 states have internal predecessors, (11321), 509 states have call successors, (509), 227 states have call predecessors, (509), 319 states have return successors, (832), 537 states have call predecessors, (832), 506 states have call successors, (832) [2025-01-09 06:06:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 12662 transitions. [2025-01-09 06:06:28,879 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 12662 transitions. Word has length 177 [2025-01-09 06:06:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:28,880 INFO L471 AbstractCegarLoop]: Abstraction has 8211 states and 12662 transitions. [2025-01-09 06:06:28,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 12662 transitions. [2025-01-09 06:06:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:28,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:28,883 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, 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:06:28,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 06:06:28,883 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:28,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash 826735550, now seen corresponding path program 1 times [2025-01-09 06:06:28,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:28,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867771400] [2025-01-09 06:06:28,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:28,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:28,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:28,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:28,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:28,965 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:06:28,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:28,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867771400] [2025-01-09 06:06:28,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867771400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:28,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:28,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:28,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346766077] [2025-01-09 06:06:28,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:28,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:28,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:28,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:28,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:28,967 INFO L87 Difference]: Start difference. First operand 8211 states and 12662 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:29,682 INFO L93 Difference]: Finished difference Result 16199 states and 26082 transitions. [2025-01-09 06:06:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:29,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:29,708 INFO L225 Difference]: With dead ends: 16199 [2025-01-09 06:06:29,708 INFO L226 Difference]: Without dead ends: 9373 [2025-01-09 06:06:29,716 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:06:29,716 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 954 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:29,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1275 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9373 states. [2025-01-09 06:06:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9373 to 8211. [2025-01-09 06:06:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8211 states, 7381 states have (on average 1.5314997967755046) internal successors, (11304), 7462 states have internal predecessors, (11304), 509 states have call successors, (509), 227 states have call predecessors, (509), 319 states have return successors, (832), 537 states have call predecessors, (832), 506 states have call successors, (832) [2025-01-09 06:06:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 12645 transitions. [2025-01-09 06:06:30,152 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 12645 transitions. Word has length 177 [2025-01-09 06:06:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:30,152 INFO L471 AbstractCegarLoop]: Abstraction has 8211 states and 12645 transitions. [2025-01-09 06:06:30,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:06:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 12645 transitions. [2025-01-09 06:06:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:30,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:30,156 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, 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:06:30,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 06:06:30,157 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 670755008, now seen corresponding path program 1 times [2025-01-09 06:06:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624568909] [2025-01-09 06:06:30,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:30,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:30,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:30,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:30,239 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:06:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624568909] [2025-01-09 06:06:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624568909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:30,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:30,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020501556] [2025-01-09 06:06:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:30,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:30,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:30,241 INFO L87 Difference]: Start difference. First operand 8211 states and 12645 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:31,554 INFO L93 Difference]: Finished difference Result 24077 states and 38969 transitions. [2025-01-09 06:06:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:31,603 INFO L225 Difference]: With dead ends: 24077 [2025-01-09 06:06:31,603 INFO L226 Difference]: Without dead ends: 17251 [2025-01-09 06:06:31,617 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:06:31,617 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 1589 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:31,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 3174 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17251 states. [2025-01-09 06:06:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17251 to 15517. [2025-01-09 06:06:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15517 states, 14125 states have (on average 1.5828672566371682) internal successors, (22358), 14352 states have internal predecessors, (22358), 829 states have call successors, (829), 323 states have call predecessors, (829), 561 states have return successors, (1920), 873 states have call predecessors, (1920), 826 states have call successors, (1920) [2025-01-09 06:06:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15517 states to 15517 states and 25107 transitions. [2025-01-09 06:06:32,357 INFO L78 Accepts]: Start accepts. Automaton has 15517 states and 25107 transitions. Word has length 177 [2025-01-09 06:06:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:32,357 INFO L471 AbstractCegarLoop]: Abstraction has 15517 states and 25107 transitions. [2025-01-09 06:06:32,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15517 states and 25107 transitions. [2025-01-09 06:06:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:32,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:32,362 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, 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:06:32,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 06:06:32,362 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:32,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1081365374, now seen corresponding path program 1 times [2025-01-09 06:06:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:32,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803610971] [2025-01-09 06:06:32,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:32,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:32,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:32,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:32,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:32,494 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:06:32,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803610971] [2025-01-09 06:06:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803610971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:32,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437997991] [2025-01-09 06:06:32,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:32,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:32,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:32,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:32,496 INFO L87 Difference]: Start difference. First operand 15517 states and 25107 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:34,390 INFO L93 Difference]: Finished difference Result 49135 states and 83173 transitions. [2025-01-09 06:06:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:34,495 INFO L225 Difference]: With dead ends: 49135 [2025-01-09 06:06:34,495 INFO L226 Difference]: Without dead ends: 35003 [2025-01-09 06:06:34,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:06:34,527 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 1344 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:34,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3166 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35003 states. [2025-01-09 06:06:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35003 to 32056. [2025-01-09 06:06:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32056 states, 29394 states have (on average 1.6284275702524325) internal successors, (47866), 30075 states have internal predecessors, (47866), 1453 states have call successors, (1453), 515 states have call predecessors, (1453), 1207 states have return successors, (5616), 1529 states have call predecessors, (5616), 1450 states have call successors, (5616) [2025-01-09 06:06:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32056 states to 32056 states and 54935 transitions. [2025-01-09 06:06:36,453 INFO L78 Accepts]: Start accepts. Automaton has 32056 states and 54935 transitions. Word has length 177 [2025-01-09 06:06:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:36,453 INFO L471 AbstractCegarLoop]: Abstraction has 32056 states and 54935 transitions. [2025-01-09 06:06:36,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 32056 states and 54935 transitions. [2025-01-09 06:06:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:36,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:36,462 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, 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:06:36,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 06:06:36,462 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:36,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash -706504448, now seen corresponding path program 1 times [2025-01-09 06:06:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:36,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642970636] [2025-01-09 06:06:36,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:36,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:36,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:36,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:36,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:36,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:36,544 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:06:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642970636] [2025-01-09 06:06:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642970636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687229550] [2025-01-09 06:06:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:36,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:36,547 INFO L87 Difference]: Start difference. First operand 32056 states and 54935 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,319 INFO L93 Difference]: Finished difference Result 106124 states and 191207 transitions. [2025-01-09 06:06:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:40,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,596 INFO L225 Difference]: With dead ends: 106124 [2025-01-09 06:06:40,596 INFO L226 Difference]: Without dead ends: 75453 [2025-01-09 06:06:40,670 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:06:40,671 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 1520 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 3154 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:06:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75453 states. [2025-01-09 06:06:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75453 to 70141. [2025-01-09 06:06:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70141 states, 64485 states have (on average 1.6675816081259207) internal successors, (107534), 66560 states have internal predecessors, (107534), 2669 states have call successors, (2669), 899 states have call predecessors, (2669), 2985 states have return successors, (19120), 2809 states have call predecessors, (19120), 2666 states have call successors, (19120) [2025-01-09 06:06:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70141 states to 70141 states and 129323 transitions. [2025-01-09 06:06:45,616 INFO L78 Accepts]: Start accepts. Automaton has 70141 states and 129323 transitions. Word has length 177 [2025-01-09 06:06:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:45,617 INFO L471 AbstractCegarLoop]: Abstraction has 70141 states and 129323 transitions. [2025-01-09 06:06:45,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 70141 states and 129323 transitions. [2025-01-09 06:06:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 06:06:45,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:45,633 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, 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:06:45,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 06:06:45,633 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:45,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1452579646, now seen corresponding path program 1 times [2025-01-09 06:06:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:45,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492151899] [2025-01-09 06:06:45,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:45,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 06:06:45,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 06:06:45,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:45,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:45,710 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:06:45,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492151899] [2025-01-09 06:06:45,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492151899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:45,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:45,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460233427] [2025-01-09 06:06:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:45,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:45,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:45,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:45,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:45,712 INFO L87 Difference]: Start difference. First operand 70141 states and 129323 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:54,481 INFO L93 Difference]: Finished difference Result 235045 states and 462881 transitions. [2025-01-09 06:06:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:54,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 177 [2025-01-09 06:06:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:55,125 INFO L225 Difference]: With dead ends: 235045 [2025-01-09 06:06:55,125 INFO L226 Difference]: Without dead ends: 166289 [2025-01-09 06:06:55,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:06:55,277 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1346 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:55,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 2287 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166289 states.