./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.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_1.cil-2+token_ring.11.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 67b249d19bfb29e53a3ada528cfb44b497320fbfc38e7386ce56807633f41524 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:02:56,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:02:57,015 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:02:57,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:02:57,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:02:57,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:02:57,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:02:57,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:02:57,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:02:57,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:02:57,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:02:57,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:02:57,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:02:57,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:02:57,034 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:02:57,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:02:57,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:02:57,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:02:57,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:57,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:57,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:02:57,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:02:57,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:02:57,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:02:57,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:02:57,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:02:57,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:02:57,037 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 -> 67b249d19bfb29e53a3ada528cfb44b497320fbfc38e7386ce56807633f41524 [2025-01-09 06:02:57,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:02:57,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:02:57,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:02:57,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:02:57,236 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:02:57,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2025-01-09 06:02:58,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/459d72be7/f1acb3d713bf4908941eb52a7e788153/FLAGc8d923df2 [2025-01-09 06:02:58,741 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:02:58,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2025-01-09 06:02:58,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/459d72be7/f1acb3d713bf4908941eb52a7e788153/FLAGc8d923df2 [2025-01-09 06:02:58,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/459d72be7/f1acb3d713bf4908941eb52a7e788153 [2025-01-09 06:02:58,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:02:58,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:02:58,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:02:58,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:02:58,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:02:58,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:02:58" (1/1) ... [2025-01-09 06:02:58,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56051390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:58, skipping insertion in model container [2025-01-09 06:02:58,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:02:58" (1/1) ... [2025-01-09 06:02:58,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:02:59,072 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_1.cil-2+token_ring.11.cil-2.c[913,926] [2025-01-09 06:02:59,103 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_1.cil-2+token_ring.11.cil-2.c[5977,5990] [2025-01-09 06:02:59,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:02:59,173 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:02:59,181 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_1.cil-2+token_ring.11.cil-2.c[913,926] [2025-01-09 06:02:59,194 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_1.cil-2+token_ring.11.cil-2.c[5977,5990] [2025-01-09 06:02:59,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:02:59,254 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:02:59,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59 WrapperNode [2025-01-09 06:02:59,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:02:59,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:02:59,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:02:59,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:02:59,261 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:02:59" (1/1) ... [2025-01-09 06:02:59,273 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:02:59" (1/1) ... [2025-01-09 06:02:59,330 INFO L138 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 969 [2025-01-09 06:02:59,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:02:59,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:02:59,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:02:59,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:02:59,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,370 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:02:59,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:02:59,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:02:59,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:02:59,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:02:59,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (1/1) ... [2025-01-09 06:02:59,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:59,463 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:02:59,475 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:02:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:02:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:02:59,507 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:02:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-01-09 06:02:59,507 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-01-09 06:02:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:02:59,508 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:02:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:02:59,508 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:02:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:02:59,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:02:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:02:59,509 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:02:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:02:59,509 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:02:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:02:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:02:59,509 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:02:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:02:59,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:02:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:02:59,509 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:02:59,640 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:02:59,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:03:00,429 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-01-09 06:03:00,430 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:03:00,443 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:03:00,443 INFO L312 CfgBuilder]: Removed 18 assume(true) statements. [2025-01-09 06:03:00,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:03:00 BoogieIcfgContainer [2025-01-09 06:03:00,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:03:00,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:03:00,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:03:00,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:03:00,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:02:58" (1/3) ... [2025-01-09 06:03:00,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218544ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:03:00, skipping insertion in model container [2025-01-09 06:03:00,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:59" (2/3) ... [2025-01-09 06:03:00,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218544ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:03:00, skipping insertion in model container [2025-01-09 06:03:00,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:03:00" (3/3) ... [2025-01-09 06:03:00,453 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.11.cil-2.c [2025-01-09 06:03:00,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:03:00,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.11.cil-2.c that has 10 procedures, 423 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-01-09 06:03:00,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:03:00,519 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;@204ef4b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:03:00,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:03:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 423 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 385 states have internal predecessors, (611), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 06:03:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 06:03:00,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:00,533 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] [2025-01-09 06:03:00,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:00,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash -330456955, now seen corresponding path program 1 times [2025-01-09 06:03:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:00,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226945946] [2025-01-09 06:03:00,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:00,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 06:03:00,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 06:03:00,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:00,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:00,800 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:03:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226945946] [2025-01-09 06:03:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226945946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:00,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:00,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020303272] [2025-01-09 06:03:00,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:00,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:00,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:00,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:00,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:00,827 INFO L87 Difference]: Start difference. First operand has 423 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 385 states have internal predecessors, (611), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:03:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:00,914 INFO L93 Difference]: Finished difference Result 877 states and 1392 transitions. [2025-01-09 06:03:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:00,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-01-09 06:03:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:00,927 INFO L225 Difference]: With dead ends: 877 [2025-01-09 06:03:00,927 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 06:03:00,933 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:03:00,936 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 631 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:00,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 744 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 06:03:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2025-01-09 06:03:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 417 states have (on average 1.5419664268585132) internal successors, (643), 420 states have internal predecessors, (643), 35 states have call successors, (35), 11 states have call predecessors, (35), 10 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37) [2025-01-09 06:03:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 715 transitions. [2025-01-09 06:03:01,020 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 715 transitions. Word has length 41 [2025-01-09 06:03:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:01,021 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 715 transitions. [2025-01-09 06:03:01,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:03:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 715 transitions. [2025-01-09 06:03:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 06:03:01,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:01,024 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] [2025-01-09 06:03:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:03:01,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1425003137, now seen corresponding path program 1 times [2025-01-09 06:03:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308979670] [2025-01-09 06:03:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:01,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 06:03:01,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 06:03:01,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:01,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:01,096 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:03:01,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308979670] [2025-01-09 06:03:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308979670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369906813] [2025-01-09 06:03:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:01,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:01,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:01,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:01,099 INFO L87 Difference]: Start difference. First operand 464 states and 715 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:03:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:01,180 INFO L93 Difference]: Finished difference Result 657 states and 988 transitions. [2025-01-09 06:03:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-01-09 06:03:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:01,189 INFO L225 Difference]: With dead ends: 657 [2025-01-09 06:03:01,190 INFO L226 Difference]: Without dead ends: 550 [2025-01-09 06:03:01,190 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:03:01,191 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 66 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:01,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1283 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-01-09 06:03:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 525. [2025-01-09 06:03:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 472 states have (on average 1.527542372881356) internal successors, (721), 475 states have internal predecessors, (721), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (41), 36 states have call predecessors, (41), 36 states have call successors, (41) [2025-01-09 06:03:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 800 transitions. [2025-01-09 06:03:01,286 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 800 transitions. Word has length 42 [2025-01-09 06:03:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:01,286 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 800 transitions. [2025-01-09 06:03:01,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:03:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 800 transitions. [2025-01-09 06:03:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 06:03:01,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:01,288 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] [2025-01-09 06:03:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:03:01,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:01,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash -793353342, now seen corresponding path program 1 times [2025-01-09 06:03:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947711848] [2025-01-09 06:03:01,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:01,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:01,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 06:03:01,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 06:03:01,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:01,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:01,487 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:03:01,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947711848] [2025-01-09 06:03:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947711848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:01,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:01,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929740839] [2025-01-09 06:03:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:01,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:01,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:01,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:01,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:01,489 INFO L87 Difference]: Start difference. First operand 525 states and 800 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:03:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:01,535 INFO L93 Difference]: Finished difference Result 850 states and 1260 transitions. [2025-01-09 06:03:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:01,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-01-09 06:03:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:01,545 INFO L225 Difference]: With dead ends: 850 [2025-01-09 06:03:01,546 INFO L226 Difference]: Without dead ends: 682 [2025-01-09 06:03:01,547 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:03:01,547 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 618 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 724 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:03:01,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 724 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-01-09 06:03:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 670. [2025-01-09 06:03:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 599 states have (on average 1.4874791318864775) internal successors, (891), 604 states have internal predecessors, (891), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (57), 45 states have call predecessors, (57), 47 states have call successors, (57) [2025-01-09 06:03:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 997 transitions. [2025-01-09 06:03:01,590 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 997 transitions. Word has length 43 [2025-01-09 06:03:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:01,591 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 997 transitions. [2025-01-09 06:03:01,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 06:03:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 997 transitions. [2025-01-09 06:03:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 06:03:01,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:01,594 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] [2025-01-09 06:03:01,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:03:01,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:01,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash -393020068, now seen corresponding path program 1 times [2025-01-09 06:03:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813129032] [2025-01-09 06:03:01,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:01,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 06:03:01,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 06:03:01,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:01,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:01,685 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:03:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:01,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813129032] [2025-01-09 06:03:01,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813129032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:01,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578965888] [2025-01-09 06:03:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:01,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:01,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:01,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:01,689 INFO L87 Difference]: Start difference. First operand 670 states and 997 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:03:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:01,761 INFO L93 Difference]: Finished difference Result 1141 states and 1653 transitions. [2025-01-09 06:03:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:01,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-01-09 06:03:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:01,768 INFO L225 Difference]: With dead ends: 1141 [2025-01-09 06:03:01,769 INFO L226 Difference]: Without dead ends: 828 [2025-01-09 06:03:01,770 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:03:01,773 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 53 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:01,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1325 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-01-09 06:03:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2025-01-09 06:03:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 735 states have (on average 1.438095238095238) internal successors, (1057), 740 states have internal predecessors, (1057), 63 states have call successors, (63), 29 states have call predecessors, (63), 28 states have return successors, (79), 59 states have call predecessors, (79), 61 states have call successors, (79) [2025-01-09 06:03:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1199 transitions. [2025-01-09 06:03:01,834 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1199 transitions. Word has length 58 [2025-01-09 06:03:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:01,836 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1199 transitions. [2025-01-09 06:03:01,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:03:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1199 transitions. [2025-01-09 06:03:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:03:01,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:01,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:01,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:03:01,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:01,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1503181185, now seen corresponding path program 1 times [2025-01-09 06:03:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:01,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622052979] [2025-01-09 06:03:01,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:01,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:03:01,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:03:01,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:01,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:03:02,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622052979] [2025-01-09 06:03:02,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622052979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:02,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655354114] [2025-01-09 06:03:02,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:02,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:02,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:02,125 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:03:02,127 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:03:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:03:02,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:03:02,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:02,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:02,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:03:02,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 06:03:02,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:03:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655354114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:02,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:03:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 06:03:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566572831] [2025-01-09 06:03:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:02,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:02,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:03:02,329 INFO L87 Difference]: Start difference. First operand 828 states and 1199 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 06:03:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:02,373 INFO L93 Difference]: Finished difference Result 1330 states and 1876 transitions. [2025-01-09 06:03:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:02,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-01-09 06:03:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:02,378 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 06:03:02,378 INFO L226 Difference]: Without dead ends: 947 [2025-01-09 06:03:02,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:03:02,380 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 597 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:02,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 718 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-01-09 06:03:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2025-01-09 06:03:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 840 states have (on average 1.4095238095238096) internal successors, (1184), 845 states have internal predecessors, (1184), 71 states have call successors, (71), 35 states have call predecessors, (71), 34 states have return successors, (91), 67 states have call predecessors, (91), 69 states have call successors, (91) [2025-01-09 06:03:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1346 transitions. [2025-01-09 06:03:02,419 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1346 transitions. Word has length 63 [2025-01-09 06:03:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:02,419 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1346 transitions. [2025-01-09 06:03:02,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 06:03:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1346 transitions. [2025-01-09 06:03:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:03:02,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:02,421 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:03:02,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 06:03:02,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:02,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:02,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1903172384, now seen corresponding path program 1 times [2025-01-09 06:03:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:02,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816416] [2025-01-09 06:03:02,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:02,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:03:02,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:03:02,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:02,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:03:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917816416] [2025-01-09 06:03:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917816416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941821337] [2025-01-09 06:03:02,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:02,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:03:02,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:03:02,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:03:02,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:03:02,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:02,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:02,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 06:03:02,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:02,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:03:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:03:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941821337] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 06:03:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-01-09 06:03:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834909371] [2025-01-09 06:03:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:03:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:03,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:03:03,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:03:03,029 INFO L87 Difference]: Start difference. First operand 947 states and 1346 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:03:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:03,236 INFO L93 Difference]: Finished difference Result 997 states and 1408 transitions. [2025-01-09 06:03:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-01-09 06:03:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:03,245 INFO L225 Difference]: With dead ends: 997 [2025-01-09 06:03:03,245 INFO L226 Difference]: Without dead ends: 994 [2025-01-09 06:03:03,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:03:03,246 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 1171 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:03,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 726 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:03:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-01-09 06:03:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 946. [2025-01-09 06:03:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 840 states have (on average 1.4071428571428573) internal successors, (1182), 844 states have internal predecessors, (1182), 70 states have call successors, (70), 35 states have call predecessors, (70), 34 states have return successors, (91), 67 states have call predecessors, (91), 69 states have call successors, (91) [2025-01-09 06:03:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1343 transitions. [2025-01-09 06:03:03,310 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1343 transitions. Word has length 63 [2025-01-09 06:03:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:03,311 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1343 transitions. [2025-01-09 06:03:03,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 06:03:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1343 transitions. [2025-01-09 06:03:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:03:03,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:03,313 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 06:03:03,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 06:03:03,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:03,515 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:03,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1132448931, now seen corresponding path program 1 times [2025-01-09 06:03:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:03,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409190521] [2025-01-09 06:03:03,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:03,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:03:03,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:03:03,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:03,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:03:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409190521] [2025-01-09 06:03:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409190521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876804270] [2025-01-09 06:03:03,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:03,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:03,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:03,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:03:03,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 06:03:03,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:03:03,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:03:03,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:03,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:03,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:03:03,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:03,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:03:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:03:04,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876804270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:03:04,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:03:04,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-01-09 06:03:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287395193] [2025-01-09 06:03:04,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:03:04,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:03:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:04,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:03:04,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:03:04,005 INFO L87 Difference]: Start difference. First operand 946 states and 1343 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 06:03:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:04,404 INFO L93 Difference]: Finished difference Result 2183 states and 3020 transitions. [2025-01-09 06:03:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 06:03:04,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 64 [2025-01-09 06:03:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:04,413 INFO L225 Difference]: With dead ends: 2183 [2025-01-09 06:03:04,413 INFO L226 Difference]: Without dead ends: 1726 [2025-01-09 06:03:04,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-01-09 06:03:04,416 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 775 mSDsluCounter, 4287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 5011 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:04,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 5011 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:03:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2025-01-09 06:03:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1281. [2025-01-09 06:03:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1139 states have (on average 1.3669885864793678) internal successors, (1557), 1148 states have internal predecessors, (1557), 90 states have call successors, (90), 49 states have call predecessors, (90), 50 states have return successors, (122), 84 states have call predecessors, (122), 89 states have call successors, (122) [2025-01-09 06:03:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1769 transitions. [2025-01-09 06:03:04,480 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1769 transitions. Word has length 64 [2025-01-09 06:03:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:04,480 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1769 transitions. [2025-01-09 06:03:04,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 06:03:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1769 transitions. [2025-01-09 06:03:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 06:03:04,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:04,484 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 06:03:04,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 06:03:04,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:04,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:04,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1990725232, now seen corresponding path program 1 times [2025-01-09 06:03:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672785933] [2025-01-09 06:03:04,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:04,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:04,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 06:03:04,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 06:03:04,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:04,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 06:03:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672785933] [2025-01-09 06:03:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672785933] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690690592] [2025-01-09 06:03:04,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:04,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:04,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:03:04,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 06:03:04,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 06:03:04,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 06:03:04,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:04,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:04,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 06:03:04,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:03:04,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:03:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690690592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:04,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:03:04,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:03:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956892092] [2025-01-09 06:03:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:04,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:04,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:04,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:04,873 INFO L87 Difference]: Start difference. First operand 1281 states and 1769 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 06:03:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:04,924 INFO L93 Difference]: Finished difference Result 1881 states and 2564 transitions. [2025-01-09 06:03:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-01-09 06:03:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:04,930 INFO L225 Difference]: With dead ends: 1881 [2025-01-09 06:03:04,930 INFO L226 Difference]: Without dead ends: 1169 [2025-01-09 06:03:04,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 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:03:04,933 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 602 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:04,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 740 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-01-09 06:03:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1160. [2025-01-09 06:03:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1032 states have (on average 1.369186046511628) internal successors, (1413), 1042 states have internal predecessors, (1413), 82 states have call successors, (82), 43 states have call predecessors, (82), 44 states have return successors, (110), 75 states have call predecessors, (110), 81 states have call successors, (110) [2025-01-09 06:03:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1605 transitions. [2025-01-09 06:03:04,981 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1605 transitions. Word has length 82 [2025-01-09 06:03:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:04,981 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1605 transitions. [2025-01-09 06:03:04,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 06:03:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1605 transitions. [2025-01-09 06:03:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 06:03:04,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:04,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:04,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 06:03:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 06:03:05,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:05,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:05,186 INFO L85 PathProgramCache]: Analyzing trace with hash 600033389, now seen corresponding path program 1 times [2025-01-09 06:03:05,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893561826] [2025-01-09 06:03:05,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:05,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:05,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 06:03:05,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 06:03:05,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:05,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 06:03:05,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:05,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893561826] [2025-01-09 06:03:05,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893561826] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:05,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777147973] [2025-01-09 06:03:05,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:05,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:05,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:05,271 INFO L229 MonitoredProcess]: Starting monitored process 6 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:03:05,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 06:03:05,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 06:03:05,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 06:03:05,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:05,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:05,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:03:05,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 06:03:05,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:03:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777147973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:05,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:03:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:03:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80715974] [2025-01-09 06:03:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:05,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:05,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:05,386 INFO L87 Difference]: Start difference. First operand 1160 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 06:03:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:05,425 INFO L93 Difference]: Finished difference Result 1509 states and 2046 transitions. [2025-01-09 06:03:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:05,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 96 [2025-01-09 06:03:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:05,428 INFO L225 Difference]: With dead ends: 1509 [2025-01-09 06:03:05,428 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 06:03:05,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 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:03:05,431 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 60 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:05,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1299 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 06:03:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-01-09 06:03:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 319 states have (on average 1.5768025078369905) internal successors, (503), 320 states have internal predecessors, (503), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 06:03:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 553 transitions. [2025-01-09 06:03:05,444 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 553 transitions. Word has length 96 [2025-01-09 06:03:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:05,444 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 553 transitions. [2025-01-09 06:03:05,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 06:03:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 553 transitions. [2025-01-09 06:03:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:05,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:05,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:05,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 06:03:05,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:05,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:05,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:05,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1352142161, now seen corresponding path program 1 times [2025-01-09 06:03:05,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:05,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635525200] [2025-01-09 06:03:05,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:05,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:05,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:05,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:05,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:05,703 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:03:05,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:05,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635525200] [2025-01-09 06:03:05,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635525200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:05,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:05,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260406935] [2025-01-09 06:03:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:05,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:05,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:05,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:05,705 INFO L87 Difference]: Start difference. First operand 351 states and 553 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:05,723 INFO L93 Difference]: Finished difference Result 688 states and 1083 transitions. [2025-01-09 06:03:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:05,725 INFO L225 Difference]: With dead ends: 688 [2025-01-09 06:03:05,725 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 06:03:05,726 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:03:05,726 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 539 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 552 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:03:05,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 552 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 06:03:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-01-09 06:03:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 319 states have (on average 1.573667711598746) internal successors, (502), 320 states have internal predecessors, (502), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 06:03:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 552 transitions. [2025-01-09 06:03:05,739 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 552 transitions. Word has length 165 [2025-01-09 06:03:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:05,739 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 552 transitions. [2025-01-09 06:03:05,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 552 transitions. [2025-01-09 06:03:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:05,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:05,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:03:05,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:05,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash -428974735, now seen corresponding path program 1 times [2025-01-09 06:03:05,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:05,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006593985] [2025-01-09 06:03:05,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:05,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:05,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:05,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:05,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:05,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006593985] [2025-01-09 06:03:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006593985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:05,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:05,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:05,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541294780] [2025-01-09 06:03:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:05,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:05,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:05,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:05,858 INFO L87 Difference]: Start difference. First operand 351 states and 552 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:06,334 INFO L93 Difference]: Finished difference Result 1057 states and 1680 transitions. [2025-01-09 06:03:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:03:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:06,338 INFO L225 Difference]: With dead ends: 1057 [2025-01-09 06:03:06,338 INFO L226 Difference]: Without dead ends: 726 [2025-01-09 06:03:06,339 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:03:06,339 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 1064 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:06,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1518 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:03:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-01-09 06:03:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 699. [2025-01-09 06:03:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 640 states have (on average 1.5859375) internal successors, (1015), 642 states have internal predecessors, (1015), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-01-09 06:03:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1106 transitions. [2025-01-09 06:03:06,364 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1106 transitions. Word has length 165 [2025-01-09 06:03:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:06,364 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1106 transitions. [2025-01-09 06:03:06,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1106 transitions. [2025-01-09 06:03:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:06,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:06,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:03:06,368 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:06,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 421226485, now seen corresponding path program 1 times [2025-01-09 06:03:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727059546] [2025-01-09 06:03:06,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:06,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:06,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:06,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:06,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:06,525 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:03:06,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:06,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727059546] [2025-01-09 06:03:06,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727059546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:06,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:06,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:06,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365559290] [2025-01-09 06:03:06,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:06,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:06,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:06,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:06,527 INFO L87 Difference]: Start difference. First operand 699 states and 1106 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:07,185 INFO L93 Difference]: Finished difference Result 1824 states and 2921 transitions. [2025-01-09 06:03:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:07,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:07,190 INFO L225 Difference]: With dead ends: 1824 [2025-01-09 06:03:07,191 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 06:03:07,192 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:03:07,193 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 1072 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:07,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 2925 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:03:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 06:03:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1022. [2025-01-09 06:03:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 936 states have (on average 1.579059829059829) internal successors, (1478), 939 states have internal predecessors, (1478), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-01-09 06:03:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1612 transitions. [2025-01-09 06:03:07,241 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1612 transitions. Word has length 165 [2025-01-09 06:03:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1612 transitions. [2025-01-09 06:03:07,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1612 transitions. [2025-01-09 06:03:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:07,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:07,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:07,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:03:07,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:07,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:07,244 INFO L85 PathProgramCache]: Analyzing trace with hash -119203021, now seen corresponding path program 1 times [2025-01-09 06:03:07,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:07,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162482308] [2025-01-09 06:03:07,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:07,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:07,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:07,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:07,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:07,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:07,407 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:03:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162482308] [2025-01-09 06:03:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162482308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:07,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607749102] [2025-01-09 06:03:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:07,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:07,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:07,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:07,409 INFO L87 Difference]: Start difference. First operand 1022 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:08,006 INFO L93 Difference]: Finished difference Result 2849 states and 4550 transitions. [2025-01-09 06:03:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:08,015 INFO L225 Difference]: With dead ends: 2849 [2025-01-09 06:03:08,015 INFO L226 Difference]: Without dead ends: 1847 [2025-01-09 06:03:08,018 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:03:08,019 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1094 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:08,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 2056 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:03:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-01-09 06:03:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1710. [2025-01-09 06:03:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1568 states have (on average 1.5822704081632653) internal successors, (2481), 1575 states have internal predecessors, (2481), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-01-09 06:03:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2707 transitions. [2025-01-09 06:03:08,104 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2707 transitions. Word has length 165 [2025-01-09 06:03:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:08,104 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2707 transitions. [2025-01-09 06:03:08,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2707 transitions. [2025-01-09 06:03:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:08,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:08,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:08,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:03:08,107 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:08,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 291407345, now seen corresponding path program 1 times [2025-01-09 06:03:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:08,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146492562] [2025-01-09 06:03:08,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:08,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:08,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:08,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:08,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:08,242 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:03:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146492562] [2025-01-09 06:03:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146492562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:08,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114133932] [2025-01-09 06:03:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:08,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:08,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:08,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:08,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:08,244 INFO L87 Difference]: Start difference. First operand 1710 states and 2707 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:08,977 INFO L93 Difference]: Finished difference Result 5073 states and 8159 transitions. [2025-01-09 06:03:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:08,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:09,008 INFO L225 Difference]: With dead ends: 5073 [2025-01-09 06:03:09,009 INFO L226 Difference]: Without dead ends: 3383 [2025-01-09 06:03:09,015 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:03:09,021 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1059 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:09,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 2883 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:03:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2025-01-09 06:03:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3209. [2025-01-09 06:03:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 2949 states have (on average 1.5981688708036623) internal successors, (4713), 2970 states have internal predecessors, (4713), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-01-09 06:03:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 5147 transitions. [2025-01-09 06:03:09,219 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 5147 transitions. Word has length 165 [2025-01-09 06:03:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:09,219 INFO L471 AbstractCegarLoop]: Abstraction has 3209 states and 5147 transitions. [2025-01-09 06:03:09,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 5147 transitions. [2025-01-09 06:03:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:09,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:09,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:03:09,224 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1496462477, now seen corresponding path program 1 times [2025-01-09 06:03:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779271001] [2025-01-09 06:03:09,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:09,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:09,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:09,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:09,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:09,372 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:03:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779271001] [2025-01-09 06:03:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779271001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:09,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211335996] [2025-01-09 06:03:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:09,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:09,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:09,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:09,374 INFO L87 Difference]: Start difference. First operand 3209 states and 5147 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:09,795 INFO L93 Difference]: Finished difference Result 6978 states and 11418 transitions. [2025-01-09 06:03:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:09,814 INFO L225 Difference]: With dead ends: 6978 [2025-01-09 06:03:09,814 INFO L226 Difference]: Without dead ends: 3789 [2025-01-09 06:03:09,826 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:03:09,827 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 748 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:09,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1082 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2025-01-09 06:03:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3209. [2025-01-09 06:03:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 2949 states have (on average 1.595116988809766) internal successors, (4704), 2970 states have internal predecessors, (4704), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-01-09 06:03:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 5138 transitions. [2025-01-09 06:03:09,962 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 5138 transitions. Word has length 165 [2025-01-09 06:03:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:09,962 INFO L471 AbstractCegarLoop]: Abstraction has 3209 states and 5138 transitions. [2025-01-09 06:03:09,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 5138 transitions. [2025-01-09 06:03:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:09,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:09,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:03:09,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:09,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 662621617, now seen corresponding path program 1 times [2025-01-09 06:03:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378456101] [2025-01-09 06:03:09,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:10,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:10,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:10,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:10,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:10,136 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:03:10,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378456101] [2025-01-09 06:03:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378456101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:10,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:10,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293851744] [2025-01-09 06:03:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:10,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:10,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:10,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:10,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:10,138 INFO L87 Difference]: Start difference. First operand 3209 states and 5138 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:10,557 INFO L93 Difference]: Finished difference Result 6949 states and 11342 transitions. [2025-01-09 06:03:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:10,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:10,575 INFO L225 Difference]: With dead ends: 6949 [2025-01-09 06:03:10,575 INFO L226 Difference]: Without dead ends: 3760 [2025-01-09 06:03:10,584 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:03:10,585 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 745 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:10,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1074 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2025-01-09 06:03:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3209. [2025-01-09 06:03:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 2949 states have (on average 1.5920651068158698) internal successors, (4695), 2970 states have internal predecessors, (4695), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-01-09 06:03:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 5129 transitions. [2025-01-09 06:03:10,775 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 5129 transitions. Word has length 165 [2025-01-09 06:03:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:10,775 INFO L471 AbstractCegarLoop]: Abstraction has 3209 states and 5129 transitions. [2025-01-09 06:03:10,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 5129 transitions. [2025-01-09 06:03:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:10,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:10,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:03:10,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 732269491, now seen corresponding path program 1 times [2025-01-09 06:03:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562994789] [2025-01-09 06:03:10,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:10,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:10,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:10,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:10,895 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:03:10,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562994789] [2025-01-09 06:03:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562994789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:10,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42124117] [2025-01-09 06:03:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:10,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:10,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:10,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:10,898 INFO L87 Difference]: Start difference. First operand 3209 states and 5129 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:11,264 INFO L93 Difference]: Finished difference Result 6920 states and 11266 transitions. [2025-01-09 06:03:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:11,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:11,338 INFO L225 Difference]: With dead ends: 6920 [2025-01-09 06:03:11,339 INFO L226 Difference]: Without dead ends: 3731 [2025-01-09 06:03:11,345 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:03:11,346 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 742 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:11,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1066 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:03:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2025-01-09 06:03:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 3209. [2025-01-09 06:03:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 2949 states have (on average 1.5890132248219735) internal successors, (4686), 2970 states have internal predecessors, (4686), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-01-09 06:03:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 5120 transitions. [2025-01-09 06:03:11,479 INFO L78 Accepts]: Start accepts. Automaton has 3209 states and 5120 transitions. Word has length 165 [2025-01-09 06:03:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:11,480 INFO L471 AbstractCegarLoop]: Abstraction has 3209 states and 5120 transitions. [2025-01-09 06:03:11,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 5120 transitions. [2025-01-09 06:03:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:11,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:11,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:11,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:03:11,482 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:11,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1150158193, now seen corresponding path program 1 times [2025-01-09 06:03:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:11,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799499279] [2025-01-09 06:03:11,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:11,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:11,634 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:03:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799499279] [2025-01-09 06:03:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799499279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664204292] [2025-01-09 06:03:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:11,637 INFO L87 Difference]: Start difference. First operand 3209 states and 5120 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:12,963 INFO L93 Difference]: Finished difference Result 9880 states and 16056 transitions. [2025-01-09 06:03:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:13,009 INFO L225 Difference]: With dead ends: 9880 [2025-01-09 06:03:13,009 INFO L226 Difference]: Without dead ends: 6691 [2025-01-09 06:03:13,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:03:13,022 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1030 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:13,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 2814 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 06:03:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6691 states. [2025-01-09 06:03:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6691 to 6477. [2025-01-09 06:03:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6477 states, 5963 states have (on average 1.6112694952205266) internal successors, (9608), 6030 states have internal predecessors, (9608), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-01-09 06:03:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6477 states to 6477 states and 10554 transitions. [2025-01-09 06:03:13,475 INFO L78 Accepts]: Start accepts. Automaton has 6477 states and 10554 transitions. Word has length 165 [2025-01-09 06:03:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:13,476 INFO L471 AbstractCegarLoop]: Abstraction has 6477 states and 10554 transitions. [2025-01-09 06:03:13,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6477 states and 10554 transitions. [2025-01-09 06:03:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:13,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:13,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:13,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:03:13,481 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:13,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1745855501, now seen corresponding path program 1 times [2025-01-09 06:03:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:13,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674267644] [2025-01-09 06:03:13,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:13,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:13,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:13,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:13,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:13,611 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:03:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674267644] [2025-01-09 06:03:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674267644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110402910] [2025-01-09 06:03:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:13,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:13,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:13,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:13,614 INFO L87 Difference]: Start difference. First operand 6477 states and 10554 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:14,182 INFO L93 Difference]: Finished difference Result 14262 states and 23774 transitions. [2025-01-09 06:03:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:14,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:14,220 INFO L225 Difference]: With dead ends: 14262 [2025-01-09 06:03:14,221 INFO L226 Difference]: Without dead ends: 7805 [2025-01-09 06:03:14,241 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:03:14,241 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 738 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:14,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1052 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2025-01-09 06:03:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 6477. [2025-01-09 06:03:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6477 states, 5963 states have (on average 1.608418581251048) internal successors, (9591), 6030 states have internal predecessors, (9591), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-01-09 06:03:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6477 states to 6477 states and 10537 transitions. [2025-01-09 06:03:14,624 INFO L78 Accepts]: Start accepts. Automaton has 6477 states and 10537 transitions. Word has length 165 [2025-01-09 06:03:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:14,625 INFO L471 AbstractCegarLoop]: Abstraction has 6477 states and 10537 transitions. [2025-01-09 06:03:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6477 states and 10537 transitions. [2025-01-09 06:03:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:14,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:14,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:14,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:03:14,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:14,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 931671345, now seen corresponding path program 1 times [2025-01-09 06:03:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589303580] [2025-01-09 06:03:14,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:14,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:14,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:14,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:14,756 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:03:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589303580] [2025-01-09 06:03:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589303580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:14,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686843958] [2025-01-09 06:03:14,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:14,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:14,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:14,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:14,760 INFO L87 Difference]: Start difference. First operand 6477 states and 10537 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:15,697 INFO L93 Difference]: Finished difference Result 20438 states and 34029 transitions. [2025-01-09 06:03:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:15,751 INFO L225 Difference]: With dead ends: 20438 [2025-01-09 06:03:15,751 INFO L226 Difference]: Without dead ends: 13981 [2025-01-09 06:03:15,775 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:03:15,776 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1050 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:15,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1972 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:03:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13981 states. [2025-01-09 06:03:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13981 to 13688. [2025-01-09 06:03:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13688 states, 12612 states have (on average 1.6332857595940373) internal successors, (20599), 12825 states have internal predecessors, (20599), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-01-09 06:03:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13688 states to 13688 states and 22953 transitions. [2025-01-09 06:03:16,654 INFO L78 Accepts]: Start accepts. Automaton has 13688 states and 22953 transitions. Word has length 165 [2025-01-09 06:03:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:16,654 INFO L471 AbstractCegarLoop]: Abstraction has 13688 states and 22953 transitions. [2025-01-09 06:03:16,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 13688 states and 22953 transitions. [2025-01-09 06:03:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:16,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:16,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:16,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:03:16,662 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:16,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1220490735, now seen corresponding path program 1 times [2025-01-09 06:03:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:16,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379462794] [2025-01-09 06:03:16,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:16,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:16,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:16,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:16,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:16,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:16,808 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:03:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:16,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379462794] [2025-01-09 06:03:16,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379462794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:16,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545364372] [2025-01-09 06:03:16,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:16,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:16,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:16,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:16,811 INFO L87 Difference]: Start difference. First operand 13688 states and 22953 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:18,532 INFO L93 Difference]: Finished difference Result 46909 states and 80772 transitions. [2025-01-09 06:03:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:18,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:18,663 INFO L225 Difference]: With dead ends: 46909 [2025-01-09 06:03:18,663 INFO L226 Difference]: Without dead ends: 33241 [2025-01-09 06:03:18,702 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:03:18,703 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1353 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:18,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 2744 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:03:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33241 states. [2025-01-09 06:03:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33241 to 30039. [2025-01-09 06:03:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30039 states, 27709 states have (on average 1.6636832798007868) internal successors, (46099), 28376 states have internal predecessors, (46099), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-01-09 06:03:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30039 states to 30039 states and 52741 transitions. [2025-01-09 06:03:20,203 INFO L78 Accepts]: Start accepts. Automaton has 30039 states and 52741 transitions. Word has length 165 [2025-01-09 06:03:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:20,204 INFO L471 AbstractCegarLoop]: Abstraction has 30039 states and 52741 transitions. [2025-01-09 06:03:20,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30039 states and 52741 transitions. [2025-01-09 06:03:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:20,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:20,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:20,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:03:20,217 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:20,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 675618161, now seen corresponding path program 1 times [2025-01-09 06:03:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773469249] [2025-01-09 06:03:20,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:20,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:20,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:20,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:20,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:20,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:20,358 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:03:20,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773469249] [2025-01-09 06:03:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773469249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:20,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:20,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60017014] [2025-01-09 06:03:20,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:20,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:20,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:20,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:20,360 INFO L87 Difference]: Start difference. First operand 30039 states and 52741 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:24,196 INFO L93 Difference]: Finished difference Result 104012 states and 189962 transitions. [2025-01-09 06:03:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:24,499 INFO L225 Difference]: With dead ends: 104012 [2025-01-09 06:03:24,499 INFO L226 Difference]: Without dead ends: 73993 [2025-01-09 06:03:24,607 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:03:24,609 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1106 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:24,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 2728 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 06:03:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73993 states. [2025-01-09 06:03:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73993 to 67978. [2025-01-09 06:03:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67978 states, 62686 states have (on average 1.69535462463708) internal successors, (106275), 64747 states have internal predecessors, (106275), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-01-09 06:03:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67978 states to 67978 states and 127573 transitions. [2025-01-09 06:03:29,249 INFO L78 Accepts]: Start accepts. Automaton has 67978 states and 127573 transitions. Word has length 165 [2025-01-09 06:03:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:29,249 INFO L471 AbstractCegarLoop]: Abstraction has 67978 states and 127573 transitions. [2025-01-09 06:03:29,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67978 states and 127573 transitions. [2025-01-09 06:03:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 06:03:29,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:29,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:29,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:03:29,269 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:29,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1350778287, now seen corresponding path program 1 times [2025-01-09 06:03:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330922330] [2025-01-09 06:03:29,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:29,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 06:03:29,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 06:03:29,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:29,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:29,380 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:03:29,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330922330] [2025-01-09 06:03:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330922330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381095516] [2025-01-09 06:03:29,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:29,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:29,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:29,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:29,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:29,382 INFO L87 Difference]: Start difference. First operand 67978 states and 127573 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:35,880 INFO L93 Difference]: Finished difference Result 237743 states and 472600 transitions. [2025-01-09 06:03:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:35,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-01-09 06:03:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:36,761 INFO L225 Difference]: With dead ends: 237743 [2025-01-09 06:03:36,762 INFO L226 Difference]: Without dead ends: 169785 [2025-01-09 06:03:37,067 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:03:37,068 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1283 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:37,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 2720 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:03:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169785 states.