./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-2.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.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:03:56,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:03:56,946 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:03:56,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:03:56,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:03:56,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:03:56,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:03:56,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:03:56,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:03:56,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:03:56,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:03:56,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:03:56,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:03:56,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:03:56,972 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:03:56,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:03:56,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:03:56,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:03:56,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:03:56,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:03:56,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:03:56,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:03:56,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:03:56,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:03:56,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:03:56,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:03:56,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:03:56,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:03:56,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:03:56,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:03:56,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:03:56,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:03:56,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:03:56,976 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 -> a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 [2025-01-09 06:03:57,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:03:57,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:03:57,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:03:57,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:03:57,239 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:03:57,241 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.04.cil-2.c [2025-01-09 06:03:58,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9df390da1/9d18bb342bf44b218f53d27295f7af26/FLAG950874ebf [2025-01-09 06:03:59,041 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:03:59,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2025-01-09 06:03:59,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9df390da1/9d18bb342bf44b218f53d27295f7af26/FLAG950874ebf [2025-01-09 06:03:59,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9df390da1/9d18bb342bf44b218f53d27295f7af26 [2025-01-09 06:03:59,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:03:59,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:03:59,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:03:59,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:03:59,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:03:59,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59, skipping insertion in model container [2025-01-09 06:03:59,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:03:59,201 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.04.cil-2.c[914,927] [2025-01-09 06:03:59,243 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.04.cil-2.c[7115,7128] [2025-01-09 06:03:59,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:03:59,284 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:03:59,292 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.04.cil-2.c[914,927] [2025-01-09 06:03:59,304 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.04.cil-2.c[7115,7128] [2025-01-09 06:03:59,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:03:59,340 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:03:59,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59 WrapperNode [2025-01-09 06:03:59,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:03:59,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:03:59,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:03:59,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:03:59,347 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:03:59" (1/1) ... [2025-01-09 06:03:59,355 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:03:59" (1/1) ... [2025-01-09 06:03:59,398 INFO L138 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 561 [2025-01-09 06:03:59,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:03:59,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:03:59,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:03:59,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:03:59,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,427 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:03:59,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:03:59,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:03:59,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:03:59,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:03:59,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (1/1) ... [2025-01-09 06:03:59,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:03:59,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:59,510 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:03:59,513 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:03:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:03:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:03:59,551 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:03:59,551 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:03:59,551 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:03:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:03:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:03:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:03:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:03:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:03:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:03:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:03:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:03:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:03:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:03:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:03:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:03:59,552 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:03:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:03:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:03:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:03:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:03:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:03:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:03:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:03:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:03:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:03:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:03:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:03:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:03:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:03:59,554 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:03:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:03:59,555 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:03:59,634 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:03:59,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:04:00,215 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-01-09 06:04:00,215 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:04:00,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:04:00,233 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 06:04:00,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:00 BoogieIcfgContainer [2025-01-09 06:04:00,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:04:00,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:04:00,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:04:00,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:04:00,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:03:59" (1/3) ... [2025-01-09 06:04:00,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb2de70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:00, skipping insertion in model container [2025-01-09 06:04:00,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:59" (2/3) ... [2025-01-09 06:04:00,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb2de70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:04:00, skipping insertion in model container [2025-01-09 06:04:00,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:04:00" (3/3) ... [2025-01-09 06:04:00,250 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2025-01-09 06:04:00,269 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:04:00,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.04.cil-2.c that has 16 procedures, 285 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-01-09 06:04:00,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:04:00,396 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;@7e90127c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:04:00,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:04:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 235 states have (on average 1.548936170212766) internal successors, (364), 241 states have internal predecessors, (364), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 06:04:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:00,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:00,424 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:04:00,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:00,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:00,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1292923113, now seen corresponding path program 1 times [2025-01-09 06:04:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559068497] [2025-01-09 06:04:00,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:00,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:00,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:00,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:00,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:00,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:01,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:04:01,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:01,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559068497] [2025-01-09 06:04:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559068497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917198820] [2025-01-09 06:04:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:01,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:01,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:01,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:01,144 INFO L87 Difference]: Start difference. First operand has 285 states, 235 states have (on average 1.548936170212766) internal successors, (364), 241 states have internal predecessors, (364), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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:04:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:01,937 INFO L93 Difference]: Finished difference Result 687 states and 1038 transitions. [2025-01-09 06:04:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:01,940 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:04:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:01,949 INFO L225 Difference]: With dead ends: 687 [2025-01-09 06:04:01,949 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 06:04:01,953 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:04:01,982 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 595 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:01,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1169 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 06:04:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 370. [2025-01-09 06:04:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 300 states have (on average 1.4966666666666666) internal successors, (449), 308 states have internal predecessors, (449), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2025-01-09 06:04:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 546 transitions. [2025-01-09 06:04:02,077 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 546 transitions. Word has length 62 [2025-01-09 06:04:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:02,079 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 546 transitions. [2025-01-09 06:04:02,079 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:04:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 546 transitions. [2025-01-09 06:04:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:02,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:02,084 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:04:02,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:04:02,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:02,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:02,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1062882137, now seen corresponding path program 1 times [2025-01-09 06:04:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055025066] [2025-01-09 06:04:02,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:02,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:02,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:02,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:02,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:02,230 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:04:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:02,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055025066] [2025-01-09 06:04:02,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055025066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:02,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:02,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901872951] [2025-01-09 06:04:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:02,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:02,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:02,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:02,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:02,233 INFO L87 Difference]: Start difference. First operand 370 states and 546 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:04:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:02,289 INFO L93 Difference]: Finished difference Result 553 states and 803 transitions. [2025-01-09 06:04:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:02,290 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:04:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:02,293 INFO L225 Difference]: With dead ends: 553 [2025-01-09 06:04:02,293 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 06:04:02,298 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:04:02,302 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 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:04:02,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 06:04:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-01-09 06:04:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 308 states have (on average 1.4837662337662338) internal successors, (457), 316 states have internal predecessors, (457), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2025-01-09 06:04:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 556 transitions. [2025-01-09 06:04:02,344 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 556 transitions. Word has length 62 [2025-01-09 06:04:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:02,345 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 556 transitions. [2025-01-09 06:04:02,345 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:04:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 556 transitions. [2025-01-09 06:04:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:02,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:02,348 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:04:02,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:04:02,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:02,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1906887639, now seen corresponding path program 1 times [2025-01-09 06:04:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:02,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9006526] [2025-01-09 06:04:02,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:02,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:02,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:02,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:02,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:02,421 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:04:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9006526] [2025-01-09 06:04:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9006526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:02,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977221273] [2025-01-09 06:04:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:02,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:02,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:02,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:02,423 INFO L87 Difference]: Start difference. First operand 380 states and 556 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:04:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:02,457 INFO L93 Difference]: Finished difference Result 573 states and 823 transitions. [2025-01-09 06:04:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:02,458 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:04:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:02,461 INFO L225 Difference]: With dead ends: 573 [2025-01-09 06:04:02,461 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 06:04:02,462 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:04:02,462 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 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:04:02,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 06:04:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-01-09 06:04:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 316 states have (on average 1.4715189873417722) internal successors, (465), 324 states have internal predecessors, (465), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2025-01-09 06:04:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 566 transitions. [2025-01-09 06:04:02,485 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 566 transitions. Word has length 62 [2025-01-09 06:04:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:02,486 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 566 transitions. [2025-01-09 06:04:02,486 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:04:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 566 transitions. [2025-01-09 06:04:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:02,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:02,488 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:04:02,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:04:02,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1844848025, now seen corresponding path program 1 times [2025-01-09 06:04:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251830766] [2025-01-09 06:04:02,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:02,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:02,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:02,618 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:04:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:02,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251830766] [2025-01-09 06:04:02,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251830766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:02,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:02,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758723356] [2025-01-09 06:04:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:02,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:02,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:02,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:02,621 INFO L87 Difference]: Start difference. First operand 390 states and 566 transitions. 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:04:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:03,091 INFO L93 Difference]: Finished difference Result 703 states and 1002 transitions. [2025-01-09 06:04:03,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:04:03,092 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:04:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:03,095 INFO L225 Difference]: With dead ends: 703 [2025-01-09 06:04:03,095 INFO L226 Difference]: Without dead ends: 509 [2025-01-09 06:04:03,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:04:03,099 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 318 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:03,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 870 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:04:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-01-09 06:04:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 478. [2025-01-09 06:04:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 385 states have (on average 1.4441558441558442) internal successors, (556), 394 states have internal predecessors, (556), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) [2025-01-09 06:04:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 681 transitions. [2025-01-09 06:04:03,141 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 681 transitions. Word has length 62 [2025-01-09 06:04:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:03,141 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 681 transitions. [2025-01-09 06:04:03,142 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:04:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 681 transitions. [2025-01-09 06:04:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:03,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:03,144 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:04:03,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:04:03,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:03,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1625993307, now seen corresponding path program 1 times [2025-01-09 06:04:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342634947] [2025-01-09 06:04:03,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:03,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:03,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:03,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:03,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:03,282 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:04:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:03,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342634947] [2025-01-09 06:04:03,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342634947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:03,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:03,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501023616] [2025-01-09 06:04:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:03,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:03,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:03,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:03,284 INFO L87 Difference]: Start difference. First operand 478 states and 681 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:04:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:03,877 INFO L93 Difference]: Finished difference Result 837 states and 1150 transitions. [2025-01-09 06:04:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:04:03,878 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:04:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:03,882 INFO L225 Difference]: With dead ends: 837 [2025-01-09 06:04:03,883 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 06:04:03,884 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:04:03,884 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 589 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:03,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 955 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 06:04:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 490. [2025-01-09 06:04:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 395 states have (on average 1.4329113924050634) internal successors, (566), 404 states have internal predecessors, (566), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) [2025-01-09 06:04:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 691 transitions. [2025-01-09 06:04:03,923 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 691 transitions. Word has length 62 [2025-01-09 06:04:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:03,923 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 691 transitions. [2025-01-09 06:04:03,923 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:04:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 691 transitions. [2025-01-09 06:04:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:04:03,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:03,925 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:04:03,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:04:03,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:03,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1203291481, now seen corresponding path program 1 times [2025-01-09 06:04:03,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:03,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221978012] [2025-01-09 06:04:03,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:03,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:03,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:04:03,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:04:03,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:03,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:04,000 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:04:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221978012] [2025-01-09 06:04:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221978012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93730303] [2025-01-09 06:04:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:04,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:04,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:04,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:04,003 INFO L87 Difference]: Start difference. First operand 490 states and 691 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:04:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:04,394 INFO L93 Difference]: Finished difference Result 1059 states and 1446 transitions. [2025-01-09 06:04:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:04,395 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:04:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:04,401 INFO L225 Difference]: With dead ends: 1059 [2025-01-09 06:04:04,401 INFO L226 Difference]: Without dead ends: 775 [2025-01-09 06:04:04,403 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:04:04,403 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 551 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:04,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 470 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-01-09 06:04:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 771. [2025-01-09 06:04:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 610 states have (on average 1.383606557377049) internal successors, (844), 626 states have internal predecessors, (844), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) [2025-01-09 06:04:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1061 transitions. [2025-01-09 06:04:04,473 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1061 transitions. Word has length 62 [2025-01-09 06:04:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:04,474 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1061 transitions. [2025-01-09 06:04:04,474 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:04:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1061 transitions. [2025-01-09 06:04:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:04:04,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:04,477 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:04:04,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:04:04,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:04,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash -411116537, now seen corresponding path program 1 times [2025-01-09 06:04:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:04,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106597556] [2025-01-09 06:04:04,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:04,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:04:04,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:04:04,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:04,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:04,517 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:04:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106597556] [2025-01-09 06:04:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106597556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:04,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558917622] [2025-01-09 06:04:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:04,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:04,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:04,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:04,519 INFO L87 Difference]: Start difference. First operand 771 states and 1061 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:04:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:04,643 INFO L93 Difference]: Finished difference Result 1840 states and 2478 transitions. [2025-01-09 06:04:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:04,644 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:04:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:04,652 INFO L225 Difference]: With dead ends: 1840 [2025-01-09 06:04:04,653 INFO L226 Difference]: Without dead ends: 1254 [2025-01-09 06:04:04,655 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:04:04,656 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 102 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:04,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 771 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-01-09 06:04:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1231. [2025-01-09 06:04:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 968 states have (on average 1.3471074380165289) internal successors, (1304), 987 states have internal predecessors, (1304), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) [2025-01-09 06:04:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1638 transitions. [2025-01-09 06:04:04,753 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1638 transitions. Word has length 63 [2025-01-09 06:04:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:04,754 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1638 transitions. [2025-01-09 06:04:04,754 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:04:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1638 transitions. [2025-01-09 06:04:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:04:04,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:04,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:04,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:04:04,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:04,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1538499046, now seen corresponding path program 1 times [2025-01-09 06:04:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:04,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676118560] [2025-01-09 06:04:04,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:04,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:04:04,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:04:04,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:04,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:04,794 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:04:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676118560] [2025-01-09 06:04:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676118560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:04,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:04,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869650034] [2025-01-09 06:04:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:04,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:04,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:04,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:04,797 INFO L87 Difference]: Start difference. First operand 1231 states and 1638 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:04:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:04,978 INFO L93 Difference]: Finished difference Result 3175 states and 4171 transitions. [2025-01-09 06:04:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-01-09 06:04:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:04,993 INFO L225 Difference]: With dead ends: 3175 [2025-01-09 06:04:04,994 INFO L226 Difference]: Without dead ends: 2149 [2025-01-09 06:04:04,998 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:04:04,998 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 376 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:04,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 507 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2025-01-09 06:04:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2063. [2025-01-09 06:04:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1604 states have (on average 1.309850374064838) internal successors, (2101), 1633 states have internal predecessors, (2101), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) [2025-01-09 06:04:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2669 transitions. [2025-01-09 06:04:05,203 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2669 transitions. Word has length 64 [2025-01-09 06:04:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2669 transitions. [2025-01-09 06:04:05,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:04:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2669 transitions. [2025-01-09 06:04:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:04:05,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:05,207 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:04:05,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:04:05,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash -608217229, now seen corresponding path program 1 times [2025-01-09 06:04:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:05,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022476295] [2025-01-09 06:04:05,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:05,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:05,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:04:05,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:04:05,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:05,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:05,278 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:04:05,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:05,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022476295] [2025-01-09 06:04:05,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022476295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:05,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:05,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:05,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282504525] [2025-01-09 06:04:05,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:05,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:05,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:05,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:05,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:05,280 INFO L87 Difference]: Start difference. First operand 2063 states and 2669 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:04:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:05,603 INFO L93 Difference]: Finished difference Result 2848 states and 3643 transitions. [2025-01-09 06:04:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:05,604 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:04:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:05,618 INFO L225 Difference]: With dead ends: 2848 [2025-01-09 06:04:05,618 INFO L226 Difference]: Without dead ends: 2845 [2025-01-09 06:04:05,620 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:04:05,620 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 752 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:05,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 494 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:04:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2025-01-09 06:04:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2812. [2025-01-09 06:04:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2176 states have (on average 1.2941176470588236) internal successors, (2816), 2215 states have internal predecessors, (2816), 318 states have call successors, (318), 252 states have call predecessors, (318), 316 states have return successors, (458), 351 states have call predecessors, (458), 315 states have call successors, (458) [2025-01-09 06:04:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 3592 transitions. [2025-01-09 06:04:05,830 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 3592 transitions. Word has length 68 [2025-01-09 06:04:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:05,830 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 3592 transitions. [2025-01-09 06:04:05,830 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:04:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3592 transitions. [2025-01-09 06:04:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:04:05,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:05,833 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:04:05,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:04:05,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:05,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1675703958, now seen corresponding path program 1 times [2025-01-09 06:04:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:05,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041323255] [2025-01-09 06:04:05,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:05,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:05,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:05,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:05,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:05,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:05,947 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:04:05,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041323255] [2025-01-09 06:04:05,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041323255] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:04:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314218441] [2025-01-09 06:04:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:05,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:04:05,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:05,956 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:04:05,957 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:04:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:04:06,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:04:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:06,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:04:06,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:04:06,346 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:04:06,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:04:06,445 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:04:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314218441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:04:06,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:04:06,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:04:06,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623103212] [2025-01-09 06:04:06,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:04:06,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:06,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:06,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:06,447 INFO L87 Difference]: Start difference. First operand 2812 states and 3592 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:04:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:07,103 INFO L93 Difference]: Finished difference Result 6595 states and 8375 transitions. [2025-01-09 06:04:07,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:04:07,104 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:04:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:07,157 INFO L225 Difference]: With dead ends: 6595 [2025-01-09 06:04:07,157 INFO L226 Difference]: Without dead ends: 6592 [2025-01-09 06:04:07,169 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:04:07,169 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 794 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:07,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1779 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2025-01-09 06:04:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 4539. [2025-01-09 06:04:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4539 states, 3517 states have (on average 1.2888825703724764) internal successors, (4533), 3578 states have internal predecessors, (4533), 502 states have call successors, (502), 410 states have call predecessors, (502), 518 states have return successors, (736), 557 states have call predecessors, (736), 499 states have call successors, (736) [2025-01-09 06:04:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 5771 transitions. [2025-01-09 06:04:07,604 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 5771 transitions. Word has length 69 [2025-01-09 06:04:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:07,605 INFO L471 AbstractCegarLoop]: Abstraction has 4539 states and 5771 transitions. [2025-01-09 06:04:07,605 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:04:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 5771 transitions. [2025-01-09 06:04:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:04:07,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:07,607 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:04:07,616 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:04:07,812 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:04:07,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:07,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash 152527400, now seen corresponding path program 2 times [2025-01-09 06:04:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069060148] [2025-01-09 06:04:07,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:04:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:07,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:04:07,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:04:07,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:04:07,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:07,865 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:04:07,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:07,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069060148] [2025-01-09 06:04:07,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069060148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:07,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:07,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990127268] [2025-01-09 06:04:07,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:07,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:07,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:07,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:07,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:07,867 INFO L87 Difference]: Start difference. First operand 4539 states and 5771 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:04:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:08,114 INFO L93 Difference]: Finished difference Result 6913 states and 8807 transitions. [2025-01-09 06:04:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:08,115 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:04:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:08,133 INFO L225 Difference]: With dead ends: 6913 [2025-01-09 06:04:08,134 INFO L226 Difference]: Without dead ends: 2988 [2025-01-09 06:04:08,143 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:04:08,144 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 374 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 605 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:04:08,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 605 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2025-01-09 06:04:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2968. [2025-01-09 06:04:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2302 states have (on average 1.2728062554300608) internal successors, (2930), 2341 states have internal predecessors, (2930), 334 states have call successors, (334), 266 states have call predecessors, (334), 330 states have return successors, (462), 367 states have call predecessors, (462), 331 states have call successors, (462) [2025-01-09 06:04:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 3726 transitions. [2025-01-09 06:04:08,350 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 3726 transitions. Word has length 71 [2025-01-09 06:04:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:08,351 INFO L471 AbstractCegarLoop]: Abstraction has 2968 states and 3726 transitions. [2025-01-09 06:04:08,351 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:04:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 3726 transitions. [2025-01-09 06:04:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:04:08,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:08,354 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:04:08,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:04:08,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:08,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1657955369, now seen corresponding path program 1 times [2025-01-09 06:04:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:08,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68537959] [2025-01-09 06:04:08,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:08,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:04:08,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:04:08,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:08,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:08,431 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:04:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68537959] [2025-01-09 06:04:08,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68537959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:08,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:08,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798105564] [2025-01-09 06:04:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:08,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:08,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:08,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:08,433 INFO L87 Difference]: Start difference. First operand 2968 states and 3726 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:04:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:09,421 INFO L93 Difference]: Finished difference Result 8796 states and 10928 transitions. [2025-01-09 06:04:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:04:09,422 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:04:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:09,454 INFO L225 Difference]: With dead ends: 8796 [2025-01-09 06:04:09,454 INFO L226 Difference]: Without dead ends: 4727 [2025-01-09 06:04:09,469 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:04:09,470 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 575 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:09,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1230 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4727 states. [2025-01-09 06:04:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4727 to 4475. [2025-01-09 06:04:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 3455 states have (on average 1.2439942112879885) internal successors, (4298), 3527 states have internal predecessors, (4298), 496 states have call successors, (496), 407 states have call predecessors, (496), 522 states have return successors, (743), 547 states have call predecessors, (743), 493 states have call successors, (743) [2025-01-09 06:04:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 5537 transitions. [2025-01-09 06:04:09,780 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 5537 transitions. Word has length 80 [2025-01-09 06:04:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:09,780 INFO L471 AbstractCegarLoop]: Abstraction has 4475 states and 5537 transitions. [2025-01-09 06:04:09,780 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:04:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 5537 transitions. [2025-01-09 06:04:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:04:09,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:09,784 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:04:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:04:09,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:09,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1501607657, now seen corresponding path program 1 times [2025-01-09 06:04:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:09,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227062294] [2025-01-09 06:04:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:09,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:04:09,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:04:09,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:09,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:09,864 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:04:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:09,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227062294] [2025-01-09 06:04:09,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227062294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:09,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:04:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186500284] [2025-01-09 06:04:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:09,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:09,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:09,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:09,866 INFO L87 Difference]: Start difference. First operand 4475 states and 5537 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:04:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:11,173 INFO L93 Difference]: Finished difference Result 8111 states and 9993 transitions. [2025-01-09 06:04:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:04:11,174 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:04:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:11,214 INFO L225 Difference]: With dead ends: 8111 [2025-01-09 06:04:11,216 INFO L226 Difference]: Without dead ends: 4048 [2025-01-09 06:04:11,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 06:04:11,232 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1182 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:11,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1294 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:04:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2025-01-09 06:04:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3772. [2025-01-09 06:04:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3772 states, 2920 states have (on average 1.2380136986301369) internal successors, (3615), 2977 states have internal predecessors, (3615), 418 states have call successors, (418), 338 states have call predecessors, (418), 432 states have return successors, (570), 463 states have call predecessors, (570), 415 states have call successors, (570) [2025-01-09 06:04:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 4603 transitions. [2025-01-09 06:04:11,620 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 4603 transitions. Word has length 86 [2025-01-09 06:04:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:11,621 INFO L471 AbstractCegarLoop]: Abstraction has 3772 states and 4603 transitions. [2025-01-09 06:04:11,621 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:04:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 4603 transitions. [2025-01-09 06:04:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:11,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:11,625 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] [2025-01-09 06:04:11,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:04:11,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1956694206, now seen corresponding path program 1 times [2025-01-09 06:04:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314385] [2025-01-09 06:04:11,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:11,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:11,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:11,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:11,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:11,661 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:04:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314385] [2025-01-09 06:04:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:11,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:11,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545196598] [2025-01-09 06:04:11,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:11,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:11,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:11,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:11,664 INFO L87 Difference]: Start difference. First operand 3772 states and 4603 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:04:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:11,850 INFO L93 Difference]: Finished difference Result 3945 states and 4866 transitions. [2025-01-09 06:04:11,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:11,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:11,876 INFO L225 Difference]: With dead ends: 3945 [2025-01-09 06:04:11,877 INFO L226 Difference]: Without dead ends: 3772 [2025-01-09 06:04:11,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:04:11,881 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 268 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 525 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:04:11,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 525 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2025-01-09 06:04:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3772. [2025-01-09 06:04:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3772 states, 2920 states have (on average 1.2376712328767123) internal successors, (3614), 2977 states have internal predecessors, (3614), 418 states have call successors, (418), 338 states have call predecessors, (418), 432 states have return successors, (570), 463 states have call predecessors, (570), 415 states have call successors, (570) [2025-01-09 06:04:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 4602 transitions. [2025-01-09 06:04:12,120 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 4602 transitions. Word has length 89 [2025-01-09 06:04:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:12,120 INFO L471 AbstractCegarLoop]: Abstraction has 3772 states and 4602 transitions. [2025-01-09 06:04:12,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:04:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 4602 transitions. [2025-01-09 06:04:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:12,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:12,126 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] [2025-01-09 06:04:12,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:04:12,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:12,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1117660544, now seen corresponding path program 1 times [2025-01-09 06:04:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096367121] [2025-01-09 06:04:12,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:12,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:12,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:12,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:12,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:12,193 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:04:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:12,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096367121] [2025-01-09 06:04:12,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096367121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:12,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:12,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932967560] [2025-01-09 06:04:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:12,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:12,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:12,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:12,196 INFO L87 Difference]: Start difference. First operand 3772 states and 4602 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:04:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:12,791 INFO L93 Difference]: Finished difference Result 4128 states and 5152 transitions. [2025-01-09 06:04:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:12,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:12,817 INFO L225 Difference]: With dead ends: 4128 [2025-01-09 06:04:12,817 INFO L226 Difference]: Without dead ends: 3958 [2025-01-09 06:04:12,822 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:04:12,824 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 644 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:12,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 901 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:04:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2025-01-09 06:04:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3943. [2025-01-09 06:04:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3071 states have (on average 1.253663301856073) internal successors, (3850), 3129 states have internal predecessors, (3850), 431 states have call successors, (431), 344 states have call predecessors, (431), 439 states have return successors, (584), 476 states have call predecessors, (584), 428 states have call successors, (584) [2025-01-09 06:04:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 4865 transitions. [2025-01-09 06:04:13,141 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 4865 transitions. Word has length 89 [2025-01-09 06:04:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:13,141 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 4865 transitions. [2025-01-09 06:04:13,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:04:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 4865 transitions. [2025-01-09 06:04:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:13,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:13,146 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] [2025-01-09 06:04:13,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:04:13,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:13,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1495410300, now seen corresponding path program 1 times [2025-01-09 06:04:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562901229] [2025-01-09 06:04:13,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:13,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:13,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:13,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:13,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:13,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:13,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562901229] [2025-01-09 06:04:13,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562901229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:13,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:13,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:13,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613570522] [2025-01-09 06:04:13,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:13,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:13,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:13,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:13,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:13,257 INFO L87 Difference]: Start difference. First operand 3943 states and 4865 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:13,930 INFO L93 Difference]: Finished difference Result 4499 states and 5727 transitions. [2025-01-09 06:04:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:13,958 INFO L225 Difference]: With dead ends: 4499 [2025-01-09 06:04:13,958 INFO L226 Difference]: Without dead ends: 4158 [2025-01-09 06:04:13,961 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:04:13,961 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 637 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:13,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1612 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:04:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2025-01-09 06:04:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 4103. [2025-01-09 06:04:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4103 states, 3211 states have (on average 1.2656493304266583) internal successors, (4064), 3270 states have internal predecessors, (4064), 444 states have call successors, (444), 350 states have call predecessors, (444), 446 states have return successors, (600), 490 states have call predecessors, (600), 441 states have call successors, (600) [2025-01-09 06:04:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 5108 transitions. [2025-01-09 06:04:14,208 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 5108 transitions. Word has length 89 [2025-01-09 06:04:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:14,209 INFO L471 AbstractCegarLoop]: Abstraction has 4103 states and 5108 transitions. [2025-01-09 06:04:14,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 5108 transitions. [2025-01-09 06:04:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:14,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:14,213 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] [2025-01-09 06:04:14,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:04:14,213 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:14,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash -415632258, now seen corresponding path program 1 times [2025-01-09 06:04:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:14,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408169539] [2025-01-09 06:04:14,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:14,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:14,342 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:04:14,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:14,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408169539] [2025-01-09 06:04:14,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408169539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:14,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:14,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941987889] [2025-01-09 06:04:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:14,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:14,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:14,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:14,344 INFO L87 Difference]: Start difference. First operand 4103 states and 5108 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:15,304 INFO L93 Difference]: Finished difference Result 5001 states and 6499 transitions. [2025-01-09 06:04:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:15,319 INFO L225 Difference]: With dead ends: 5001 [2025-01-09 06:04:15,320 INFO L226 Difference]: Without dead ends: 4500 [2025-01-09 06:04:15,322 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:04:15,323 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 632 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:15,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1596 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2025-01-09 06:04:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 4440. [2025-01-09 06:04:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 3506 states have (on average 1.288933257273246) internal successors, (4519), 3569 states have internal predecessors, (4519), 470 states have call successors, (470), 362 states have call predecessors, (470), 462 states have return successors, (638), 518 states have call predecessors, (638), 467 states have call successors, (638) [2025-01-09 06:04:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 5627 transitions. [2025-01-09 06:04:15,719 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 5627 transitions. Word has length 89 [2025-01-09 06:04:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:15,720 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 5627 transitions. [2025-01-09 06:04:15,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 5627 transitions. [2025-01-09 06:04:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:15,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:15,725 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] [2025-01-09 06:04:15,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:04:15,726 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:15,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash -338731460, now seen corresponding path program 1 times [2025-01-09 06:04:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334150200] [2025-01-09 06:04:15,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:15,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:15,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:15,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:15,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:15,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:15,804 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:04:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334150200] [2025-01-09 06:04:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334150200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:15,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:15,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809059289] [2025-01-09 06:04:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:15,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:15,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:15,807 INFO L87 Difference]: Start difference. First operand 4440 states and 5627 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:04:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:16,465 INFO L93 Difference]: Finished difference Result 5366 states and 7081 transitions. [2025-01-09 06:04:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:16,490 INFO L225 Difference]: With dead ends: 5366 [2025-01-09 06:04:16,490 INFO L226 Difference]: Without dead ends: 4528 [2025-01-09 06:04:16,495 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:04:16,496 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 511 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:16,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 676 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2025-01-09 06:04:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 4440. [2025-01-09 06:04:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 3506 states have (on average 1.2875071306332002) internal successors, (4514), 3569 states have internal predecessors, (4514), 470 states have call successors, (470), 362 states have call predecessors, (470), 462 states have return successors, (638), 518 states have call predecessors, (638), 467 states have call successors, (638) [2025-01-09 06:04:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 5622 transitions. [2025-01-09 06:04:16,983 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 5622 transitions. Word has length 89 [2025-01-09 06:04:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:16,986 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 5622 transitions. [2025-01-09 06:04:16,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:04:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 5622 transitions. [2025-01-09 06:04:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:16,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:16,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] [2025-01-09 06:04:16,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:04:16,991 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1306082114, now seen corresponding path program 1 times [2025-01-09 06:04:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473242195] [2025-01-09 06:04:16,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:17,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:17,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:17,081 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:04:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473242195] [2025-01-09 06:04:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473242195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:17,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:17,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712606499] [2025-01-09 06:04:17,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:17,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:17,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:17,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:17,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:17,084 INFO L87 Difference]: Start difference. First operand 4440 states and 5622 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:04:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:17,750 INFO L93 Difference]: Finished difference Result 5355 states and 7049 transitions. [2025-01-09 06:04:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:17,773 INFO L225 Difference]: With dead ends: 5355 [2025-01-09 06:04:17,774 INFO L226 Difference]: Without dead ends: 4517 [2025-01-09 06:04:17,779 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:04:17,779 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 519 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:17,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 642 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2025-01-09 06:04:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 4440. [2025-01-09 06:04:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 3506 states have (on average 1.2860810039931545) internal successors, (4509), 3569 states have internal predecessors, (4509), 470 states have call successors, (470), 362 states have call predecessors, (470), 462 states have return successors, (638), 518 states have call predecessors, (638), 467 states have call successors, (638) [2025-01-09 06:04:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 5617 transitions. [2025-01-09 06:04:18,291 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 5617 transitions. Word has length 89 [2025-01-09 06:04:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:18,291 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 5617 transitions. [2025-01-09 06:04:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:04:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 5617 transitions. [2025-01-09 06:04:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:18,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:18,295 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] [2025-01-09 06:04:18,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:04:18,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:18,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash 602375676, now seen corresponding path program 1 times [2025-01-09 06:04:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:18,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464709535] [2025-01-09 06:04:18,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:18,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:18,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:18,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:18,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:18,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:18,375 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:04:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464709535] [2025-01-09 06:04:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464709535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:18,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411174681] [2025-01-09 06:04:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:18,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:18,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:18,377 INFO L87 Difference]: Start difference. First operand 4440 states and 5617 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:19,367 INFO L93 Difference]: Finished difference Result 6120 states and 8199 transitions. [2025-01-09 06:04:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:19,383 INFO L225 Difference]: With dead ends: 6120 [2025-01-09 06:04:19,383 INFO L226 Difference]: Without dead ends: 5282 [2025-01-09 06:04:19,386 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:04:19,386 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 711 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:19,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1515 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:04:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2025-01-09 06:04:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5084. [2025-01-09 06:04:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5084 states, 4064 states have (on average 1.3166830708661417) internal successors, (5351), 4141 states have internal predecessors, (5351), 518 states have call successors, (518), 386 states have call predecessors, (518), 500 states have return successors, (734), 570 states have call predecessors, (734), 515 states have call successors, (734) [2025-01-09 06:04:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 6603 transitions. [2025-01-09 06:04:19,899 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 6603 transitions. Word has length 89 [2025-01-09 06:04:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:19,899 INFO L471 AbstractCegarLoop]: Abstraction has 5084 states and 6603 transitions. [2025-01-09 06:04:19,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 6603 transitions. [2025-01-09 06:04:19,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:19,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:19,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:19,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:04:19,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:19,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1556315834, now seen corresponding path program 1 times [2025-01-09 06:04:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948123686] [2025-01-09 06:04:19,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:19,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:19,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:19,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:19,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948123686] [2025-01-09 06:04:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948123686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:19,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838612489] [2025-01-09 06:04:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:19,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:19,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:19,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:19,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:19,971 INFO L87 Difference]: Start difference. First operand 5084 states and 6603 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:20,992 INFO L93 Difference]: Finished difference Result 8176 states and 11415 transitions. [2025-01-09 06:04:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:20,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:21,019 INFO L225 Difference]: With dead ends: 8176 [2025-01-09 06:04:21,019 INFO L226 Difference]: Without dead ends: 6694 [2025-01-09 06:04:21,024 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:04:21,026 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 626 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:21,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1507 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2025-01-09 06:04:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6459. [2025-01-09 06:04:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6459 states, 5253 states have (on average 1.3636017513801637) internal successors, (7163), 5376 states have internal predecessors, (7163), 610 states have call successors, (610), 434 states have call predecessors, (610), 594 states have return successors, (1018), 670 states have call predecessors, (1018), 607 states have call successors, (1018) [2025-01-09 06:04:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 8791 transitions. [2025-01-09 06:04:21,643 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 8791 transitions. Word has length 89 [2025-01-09 06:04:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:21,644 INFO L471 AbstractCegarLoop]: Abstraction has 6459 states and 8791 transitions. [2025-01-09 06:04:21,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 8791 transitions. [2025-01-09 06:04:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:21,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:21,651 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] [2025-01-09 06:04:21,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:04:21,651 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:21,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash 340162108, now seen corresponding path program 1 times [2025-01-09 06:04:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924232271] [2025-01-09 06:04:21,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:21,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:21,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:21,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:21,747 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:04:21,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:21,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924232271] [2025-01-09 06:04:21,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924232271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:21,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:21,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543309845] [2025-01-09 06:04:21,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:21,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:21,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:21,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:21,750 INFO L87 Difference]: Start difference. First operand 6459 states and 8791 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:22,778 INFO L93 Difference]: Finished difference Result 12489 states and 18549 transitions. [2025-01-09 06:04:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:22,814 INFO L225 Difference]: With dead ends: 12489 [2025-01-09 06:04:22,815 INFO L226 Difference]: Without dead ends: 9632 [2025-01-09 06:04:22,827 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:04:22,829 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 642 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:22,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1495 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2025-01-09 06:04:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 9320. [2025-01-09 06:04:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9320 states, 7696 states have (on average 1.412551975051975) internal successors, (10871), 7965 states have internal predecessors, (10871), 786 states have call successors, (786), 530 states have call predecessors, (786), 836 states have return successors, (1962), 862 states have call predecessors, (1962), 783 states have call successors, (1962) [2025-01-09 06:04:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 13619 transitions. [2025-01-09 06:04:23,546 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 13619 transitions. Word has length 89 [2025-01-09 06:04:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:23,546 INFO L471 AbstractCegarLoop]: Abstraction has 9320 states and 13619 transitions. [2025-01-09 06:04:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 13619 transitions. [2025-01-09 06:04:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:23,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:23,552 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] [2025-01-09 06:04:23,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:04:23,553 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -391805318, now seen corresponding path program 1 times [2025-01-09 06:04:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329893683] [2025-01-09 06:04:23,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:23,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:23,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:23,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:23,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:23,617 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:04:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329893683] [2025-01-09 06:04:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329893683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398999118] [2025-01-09 06:04:23,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:23,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:23,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:23,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:23,619 INFO L87 Difference]: Start difference. First operand 9320 states and 13619 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:25,651 INFO L93 Difference]: Finished difference Result 21296 states and 34531 transitions. [2025-01-09 06:04:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:25,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 89 [2025-01-09 06:04:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:25,727 INFO L225 Difference]: With dead ends: 21296 [2025-01-09 06:04:25,727 INFO L226 Difference]: Without dead ends: 15578 [2025-01-09 06:04:25,753 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:04:25,754 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 607 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:25,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1483 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15578 states. [2025-01-09 06:04:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15578 to 15237. [2025-01-09 06:04:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15237 states, 12631 states have (on average 1.44398701607157) internal successors, (18239), 13354 states have internal predecessors, (18239), 1122 states have call successors, (1122), 722 states have call predecessors, (1122), 1482 states have return successors, (5370), 1230 states have call predecessors, (5370), 1119 states have call successors, (5370) [2025-01-09 06:04:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 24731 transitions. [2025-01-09 06:04:27,136 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 24731 transitions. Word has length 89 [2025-01-09 06:04:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:27,137 INFO L471 AbstractCegarLoop]: Abstraction has 15237 states and 24731 transitions. [2025-01-09 06:04:27,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:04:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 24731 transitions. [2025-01-09 06:04:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:27,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:27,147 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] [2025-01-09 06:04:27,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:04:27,148 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:27,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2077985156, now seen corresponding path program 1 times [2025-01-09 06:04:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:27,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888819357] [2025-01-09 06:04:27,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:27,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:27,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:27,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888819357] [2025-01-09 06:04:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888819357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:27,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:27,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245265791] [2025-01-09 06:04:27,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:27,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:27,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:27,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:27,204 INFO L87 Difference]: Start difference. First operand 15237 states and 24731 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:28,254 INFO L93 Difference]: Finished difference Result 27066 states and 45705 transitions. [2025-01-09 06:04:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:28,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 06:04:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:28,333 INFO L225 Difference]: With dead ends: 27066 [2025-01-09 06:04:28,333 INFO L226 Difference]: Without dead ends: 15432 [2025-01-09 06:04:28,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:28,375 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:28,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15432 states. [2025-01-09 06:04:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15432 to 15432. [2025-01-09 06:04:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15432 states, 12826 states have (on average 1.4372368626227974) internal successors, (18434), 13549 states have internal predecessors, (18434), 1122 states have call successors, (1122), 722 states have call predecessors, (1122), 1482 states have return successors, (5370), 1230 states have call predecessors, (5370), 1119 states have call successors, (5370) [2025-01-09 06:04:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15432 states to 15432 states and 24926 transitions. [2025-01-09 06:04:29,941 INFO L78 Accepts]: Start accepts. Automaton has 15432 states and 24926 transitions. Word has length 89 [2025-01-09 06:04:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:29,942 INFO L471 AbstractCegarLoop]: Abstraction has 15432 states and 24926 transitions. [2025-01-09 06:04:29,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 15432 states and 24926 transitions. [2025-01-09 06:04:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:29,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:29,952 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] [2025-01-09 06:04:29,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:04:29,953 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:29,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2037310406, now seen corresponding path program 1 times [2025-01-09 06:04:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:29,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040548557] [2025-01-09 06:04:29,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:29,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:29,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:29,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:29,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:30,006 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:04:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040548557] [2025-01-09 06:04:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040548557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495915194] [2025-01-09 06:04:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:30,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:30,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:30,010 INFO L87 Difference]: Start difference. First operand 15432 states and 24926 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:32,856 INFO L93 Difference]: Finished difference Result 38860 states and 65990 transitions. [2025-01-09 06:04:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:04:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 06:04:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:32,972 INFO L225 Difference]: With dead ends: 38860 [2025-01-09 06:04:32,972 INFO L226 Difference]: Without dead ends: 27031 [2025-01-09 06:04:33,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:33,010 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 602 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:33,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1170 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:04:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2025-01-09 06:04:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 26962. [2025-01-09 06:04:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26962 states, 22615 states have (on average 1.4572628786203847) internal successors, (32956), 24004 states have internal predecessors, (32956), 1807 states have call successors, (1807), 1112 states have call predecessors, (1807), 2538 states have return successors, (10088), 1915 states have call predecessors, (10088), 1804 states have call successors, (10088) [2025-01-09 06:04:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26962 states to 26962 states and 44851 transitions. [2025-01-09 06:04:35,099 INFO L78 Accepts]: Start accepts. Automaton has 26962 states and 44851 transitions. Word has length 89 [2025-01-09 06:04:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:35,100 INFO L471 AbstractCegarLoop]: Abstraction has 26962 states and 44851 transitions. [2025-01-09 06:04:35,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 26962 states and 44851 transitions. [2025-01-09 06:04:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:35,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:35,109 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] [2025-01-09 06:04:35,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:04:35,109 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:35,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1934509159, now seen corresponding path program 1 times [2025-01-09 06:04:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426395043] [2025-01-09 06:04:35,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:35,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:35,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:35,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:35,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:35,145 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:04:35,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426395043] [2025-01-09 06:04:35,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426395043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:35,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872212450] [2025-01-09 06:04:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:35,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:35,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:35,147 INFO L87 Difference]: Start difference. First operand 26962 states and 44851 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:37,577 INFO L93 Difference]: Finished difference Result 50516 states and 86240 transitions. [2025-01-09 06:04:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 06:04:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:37,753 INFO L225 Difference]: With dead ends: 50516 [2025-01-09 06:04:37,753 INFO L226 Difference]: Without dead ends: 27157 [2025-01-09 06:04:37,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:37,834 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:37,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27157 states. [2025-01-09 06:04:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27157 to 27157. [2025-01-09 06:04:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27157 states, 22810 states have (on average 1.4505041648399826) internal successors, (33086), 24199 states have internal predecessors, (33086), 1807 states have call successors, (1807), 1112 states have call predecessors, (1807), 2538 states have return successors, (10088), 1915 states have call predecessors, (10088), 1804 states have call successors, (10088) [2025-01-09 06:04:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27157 states to 27157 states and 44981 transitions. [2025-01-09 06:04:40,161 INFO L78 Accepts]: Start accepts. Automaton has 27157 states and 44981 transitions. Word has length 89 [2025-01-09 06:04:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:40,162 INFO L471 AbstractCegarLoop]: Abstraction has 27157 states and 44981 transitions. [2025-01-09 06:04:40,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27157 states and 44981 transitions. [2025-01-09 06:04:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:40,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:40,170 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] [2025-01-09 06:04:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:04:40,170 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1879377879, now seen corresponding path program 1 times [2025-01-09 06:04:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332665481] [2025-01-09 06:04:40,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:40,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:40,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:40,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:40,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:40,205 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:04:40,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:40,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332665481] [2025-01-09 06:04:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332665481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:40,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:40,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482388325] [2025-01-09 06:04:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:40,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:40,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:40,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:40,207 INFO L87 Difference]: Start difference. First operand 27157 states and 44981 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:42,186 INFO L93 Difference]: Finished difference Result 51101 states and 86760 transitions. [2025-01-09 06:04:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:42,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 89 [2025-01-09 06:04:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:42,358 INFO L225 Difference]: With dead ends: 51101 [2025-01-09 06:04:42,359 INFO L226 Difference]: Without dead ends: 27547 [2025-01-09 06:04:42,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:42,430 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:42,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27547 states. [2025-01-09 06:04:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27547 to 27547. [2025-01-09 06:04:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27547 states, 23200 states have (on average 1.4429310344827586) internal successors, (33476), 24589 states have internal predecessors, (33476), 1807 states have call successors, (1807), 1112 states have call predecessors, (1807), 2538 states have return successors, (10088), 1915 states have call predecessors, (10088), 1804 states have call successors, (10088) [2025-01-09 06:04:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27547 states to 27547 states and 45371 transitions. [2025-01-09 06:04:45,532 INFO L78 Accepts]: Start accepts. Automaton has 27547 states and 45371 transitions. Word has length 89 [2025-01-09 06:04:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:45,533 INFO L471 AbstractCegarLoop]: Abstraction has 27547 states and 45371 transitions. [2025-01-09 06:04:45,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27547 states and 45371 transitions. [2025-01-09 06:04:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 06:04:45,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:45,542 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] [2025-01-09 06:04:45,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:04:45,542 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:45,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash -170009963, now seen corresponding path program 1 times [2025-01-09 06:04:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:45,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180158193] [2025-01-09 06:04:45,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:45,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 06:04:45,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 06:04:45,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:45,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:45,695 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:04:45,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:45,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180158193] [2025-01-09 06:04:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180158193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:45,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:45,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:04:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909499299] [2025-01-09 06:04:45,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:45,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:04:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:45,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:04:45,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:04:45,698 INFO L87 Difference]: Start difference. First operand 27547 states and 45371 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)