./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:20:38,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:20:38,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:20:38,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:20:38,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:20:38,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:20:38,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:20:38,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:20:38,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:20:38,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:20:38,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:20:38,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:20:38,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:20:38,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:20:38,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:20:38,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:20:38,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:20:38,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:20:38,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:20:38,180 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/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 -> cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c [2025-03-03 16:20:38,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:20:38,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:20:38,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:20:38,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:20:38,416 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:20:38,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2025-03-03 16:20:39,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363e5262b/c961e6c0e5a54bf393c5a7ec49b02932/FLAG614f4c6a9 [2025-03-03 16:20:39,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:20:39,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2025-03-03 16:20:39,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363e5262b/c961e6c0e5a54bf393c5a7ec49b02932/FLAG614f4c6a9 [2025-03-03 16:20:39,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363e5262b/c961e6c0e5a54bf393c5a7ec49b02932 [2025-03-03 16:20:39,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:20:39,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:20:39,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:20:39,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:20:39,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:20:39,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:20:39" (1/1) ... [2025-03-03 16:20:39,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598af91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:39, skipping insertion in model container [2025-03-03 16:20:39,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:20:39" (1/1) ... [2025-03-03 16:20:39,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:20:40,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2025-03-03 16:20:40,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2025-03-03 16:20:40,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:20:40,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:20:40,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2025-03-03 16:20:40,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2025-03-03 16:20:40,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:20:40,366 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:20:40,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40 WrapperNode [2025-03-03 16:20:40,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:20:40,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:20:40,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:20:40,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:20:40,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,437 INFO L138 Inliner]: procedures = 72, calls = 84, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1026 [2025-03-03 16:20:40,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:20:40,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:20:40,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:20:40,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:20:40,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,473 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-03-03 16:20:40,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:20:40,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:20:40,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:20:40,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:20:40,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (1/1) ... [2025-03-03 16:20:40,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:20:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:40,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:20:40,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:20:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:20:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:20:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:20:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:20:40,668 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:20:40,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:20:41,519 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-03-03 16:20:41,520 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:20:41,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:20:41,544 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:20:41,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:20:41 BoogieIcfgContainer [2025-03-03 16:20:41,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:20:41,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:20:41,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:20:41,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:20:41,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:20:39" (1/3) ... [2025-03-03 16:20:41,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbb59e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:20:41, skipping insertion in model container [2025-03-03 16:20:41,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:20:40" (2/3) ... [2025-03-03 16:20:41,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbb59e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:20:41, skipping insertion in model container [2025-03-03 16:20:41,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:20:41" (3/3) ... [2025-03-03 16:20:41,554 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2025-03-03 16:20:41,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:20:41,566 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.12.cil-2.c that has 10 procedures, 482 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-03-03 16:20:41,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:20:41,626 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;@4353ebff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:20:41,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:20:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 482 states, 438 states have (on average 1.5639269406392695) internal successors, (685), 443 states have internal predecessors, (685), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 16:20:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:20:41,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:41,636 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] [2025-03-03 16:20:41,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:41,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash -489959123, now seen corresponding path program 1 times [2025-03-03 16:20:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:41,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863181547] [2025-03-03 16:20:41,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:41,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:20:41,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:20:41,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:41,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:41,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:41,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863181547] [2025-03-03 16:20:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863181547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411026452] [2025-03-03 16:20:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:41,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:41,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:41,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:41,884 INFO L87 Difference]: Start difference. First operand has 482 states, 438 states have (on average 1.5639269406392695) internal successors, (685), 443 states have internal predecessors, (685), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 16:20:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:41,983 INFO L93 Difference]: Finished difference Result 938 states and 1452 transitions. [2025-03-03 16:20:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:41,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-03 16:20:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:41,995 INFO L225 Difference]: With dead ends: 938 [2025-03-03 16:20:41,995 INFO L226 Difference]: Without dead ends: 472 [2025-03-03 16:20:41,999 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-03-03 16:20:42,002 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 95 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1348 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-03-03 16:20:42,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1348 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-03 16:20:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-03 16:20:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 430 states have (on average 1.5186046511627906) internal successors, (653), 433 states have internal predecessors, (653), 32 states have call successors, (32), 9 states have call predecessors, (32), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 16:20:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 715 transitions. [2025-03-03 16:20:42,051 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 715 transitions. Word has length 44 [2025-03-03 16:20:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:42,051 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 715 transitions. [2025-03-03 16:20:42,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 16:20:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 715 transitions. [2025-03-03 16:20:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:20:42,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:42,052 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] [2025-03-03 16:20:42,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:20:42,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:42,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 432724460, now seen corresponding path program 1 times [2025-03-03 16:20:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:42,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524772078] [2025-03-03 16:20:42,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:42,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:20:42,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:20:42,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:42,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:42,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524772078] [2025-03-03 16:20:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524772078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:42,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482572953] [2025-03-03 16:20:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:42,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:42,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:42,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:42,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:42,153 INFO L87 Difference]: Start difference. First operand 472 states and 715 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-03 16:20:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:42,197 INFO L93 Difference]: Finished difference Result 596 states and 887 transitions. [2025-03-03 16:20:42,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:42,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2025-03-03 16:20:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:42,202 INFO L225 Difference]: With dead ends: 596 [2025-03-03 16:20:42,202 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 16:20:42,203 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-03-03 16:20:42,203 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 693 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 812 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-03-03 16:20:42,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 812 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 16:20:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2025-03-03 16:20:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 480 states have (on average 1.4979166666666666) internal successors, (719), 483 states have internal predecessors, (719), 36 states have call successors, (36), 11 states have call predecessors, (36), 10 states have return successors, (38), 34 states have call predecessors, (38), 34 states have call successors, (38) [2025-03-03 16:20:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 793 transitions. [2025-03-03 16:20:42,241 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 793 transitions. Word has length 44 [2025-03-03 16:20:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:42,241 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 793 transitions. [2025-03-03 16:20:42,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03-03 16:20:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 793 transitions. [2025-03-03 16:20:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 16:20:42,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:42,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] [2025-03-03 16:20:42,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:20:42,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:42,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:42,244 INFO L85 PathProgramCache]: Analyzing trace with hash -615269671, now seen corresponding path program 1 times [2025-03-03 16:20:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:42,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173435651] [2025-03-03 16:20:42,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:42,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 16:20:42,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 16:20:42,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:42,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:42,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:42,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173435651] [2025-03-03 16:20:42,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173435651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:42,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:42,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:42,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118603212] [2025-03-03 16:20:42,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:42,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:42,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:42,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:42,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:42,347 INFO L87 Difference]: Start difference. First operand 528 states and 793 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03-03 16:20:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:42,391 INFO L93 Difference]: Finished difference Result 756 states and 1113 transitions. [2025-03-03 16:20:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:42,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2025-03-03 16:20:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:42,395 INFO L225 Difference]: With dead ends: 756 [2025-03-03 16:20:42,396 INFO L226 Difference]: Without dead ends: 638 [2025-03-03 16:20:42,397 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-03-03 16:20:42,398 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 690 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 793 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-03-03 16:20:42,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 793 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-03 16:20:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2025-03-03 16:20:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 574 states have (on average 1.4686411149825784) internal successors, (843), 577 states have internal predecessors, (843), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (50), 42 states have call predecessors, (50), 42 states have call successors, (50) [2025-03-03 16:20:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 937 transitions. [2025-03-03 16:20:42,429 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 937 transitions. Word has length 45 [2025-03-03 16:20:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:42,429 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 937 transitions. [2025-03-03 16:20:42,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03-03 16:20:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 937 transitions. [2025-03-03 16:20:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:20:42,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:42,432 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] [2025-03-03 16:20:42,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:20:42,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:42,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -751810938, now seen corresponding path program 1 times [2025-03-03 16:20:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876721944] [2025-03-03 16:20:42,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:42,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:20:42,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:20:42,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:42,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876721944] [2025-03-03 16:20:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876721944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:42,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:42,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656684406] [2025-03-03 16:20:42,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:42,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:42,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:42,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:42,497 INFO L87 Difference]: Start difference. First operand 634 states and 937 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-03-03 16:20:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:42,537 INFO L93 Difference]: Finished difference Result 1042 states and 1490 transitions. [2025-03-03 16:20:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 46 [2025-03-03 16:20:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:42,541 INFO L225 Difference]: With dead ends: 1042 [2025-03-03 16:20:42,541 INFO L226 Difference]: Without dead ends: 818 [2025-03-03 16:20:42,542 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-03-03 16:20:42,542 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 67 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1432 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-03-03 16:20:42,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1432 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-03 16:20:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 759. [2025-03-03 16:20:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 687 states have (on average 1.4439592430858808) internal successors, (992), 692 states have internal predecessors, (992), 50 states have call successors, (50), 21 states have call predecessors, (50), 20 states have return successors, (58), 46 states have call predecessors, (58), 48 states have call successors, (58) [2025-03-03 16:20:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1100 transitions. [2025-03-03 16:20:42,573 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1100 transitions. Word has length 46 [2025-03-03 16:20:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:42,573 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1100 transitions. [2025-03-03 16:20:42,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-03-03 16:20:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1100 transitions. [2025-03-03 16:20:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 16:20:42,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:42,575 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-03-03 16:20:42,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:20:42,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:42,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1484646190, now seen corresponding path program 1 times [2025-03-03 16:20:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363127311] [2025-03-03 16:20:42,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:42,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 16:20:42,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 16:20:42,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:42,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:20:42,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363127311] [2025-03-03 16:20:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363127311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:42,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515012405] [2025-03-03 16:20:42,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:42,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:42,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:42,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:42,687 INFO L87 Difference]: Start difference. First operand 759 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (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-03-03 16:20:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:42,733 INFO L93 Difference]: Finished difference Result 1048 states and 1491 transitions. [2025-03-03 16:20:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (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-03-03 16:20:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:42,738 INFO L225 Difference]: With dead ends: 1048 [2025-03-03 16:20:42,739 INFO L226 Difference]: Without dead ends: 820 [2025-03-03 16:20:42,740 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-03-03 16:20:42,740 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 55 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:42,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1479 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-03 16:20:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2025-03-03 16:20:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 740 states have (on average 1.4216216216216215) internal successors, (1052), 745 states have internal predecessors, (1052), 55 states have call successors, (55), 24 states have call predecessors, (55), 23 states have return successors, (66), 51 states have call predecessors, (66), 53 states have call successors, (66) [2025-03-03 16:20:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1173 transitions. [2025-03-03 16:20:42,788 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1173 transitions. Word has length 63 [2025-03-03 16:20:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:42,789 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1173 transitions. [2025-03-03 16:20:42,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (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-03-03 16:20:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1173 transitions. [2025-03-03 16:20:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:20:42,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:42,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:42,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:20:42,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:42,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash -460054282, now seen corresponding path program 1 times [2025-03-03 16:20:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:42,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317999491] [2025-03-03 16:20:42,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:20:42,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:20:42,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:42,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 16:20:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317999491] [2025-03-03 16:20:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317999491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:42,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:20:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625047295] [2025-03-03 16:20:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:42,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:42,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:42,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:20:42,852 INFO L87 Difference]: Start difference. First operand 820 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 16:20:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:42,902 INFO L93 Difference]: Finished difference Result 1294 states and 1795 transitions. [2025-03-03 16:20:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:42,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2025-03-03 16:20:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:42,909 INFO L225 Difference]: With dead ends: 1294 [2025-03-03 16:20:42,909 INFO L226 Difference]: Without dead ends: 933 [2025-03-03 16:20:42,910 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-03-03 16:20:42,911 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 677 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 800 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-03-03 16:20:42,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 800 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-03 16:20:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2025-03-03 16:20:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 841 states have (on average 1.3923900118906065) internal successors, (1171), 846 states have internal predecessors, (1171), 62 states have call successors, (62), 29 states have call predecessors, (62), 28 states have return successors, (76), 58 states have call predecessors, (76), 60 states have call successors, (76) [2025-03-03 16:20:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1309 transitions. [2025-03-03 16:20:42,952 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1309 transitions. Word has length 68 [2025-03-03 16:20:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:42,952 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1309 transitions. [2025-03-03 16:20:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 16:20:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1309 transitions. [2025-03-03 16:20:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:20:42,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:42,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:42,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:20:42,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash -3675050, now seen corresponding path program 1 times [2025-03-03 16:20:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410013313] [2025-03-03 16:20:42,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:42,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:20:42,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:20:42,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:42,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:20:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410013313] [2025-03-03 16:20:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410013313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959105602] [2025-03-03 16:20:43,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:43,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:43,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:43,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:43,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:20:43,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:20:43,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:20:43,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:43,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:43,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 16:20:43,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:43,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:20:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:20:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959105602] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 16:20:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-03 16:20:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40472340] [2025-03-03 16:20:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:43,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:20:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:43,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:20:43,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:20:43,313 INFO L87 Difference]: Start difference. First operand 933 states and 1309 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-03 16:20:43,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:43,497 INFO L93 Difference]: Finished difference Result 990 states and 1378 transitions. [2025-03-03 16:20:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:43,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 70 [2025-03-03 16:20:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:43,502 INFO L225 Difference]: With dead ends: 990 [2025-03-03 16:20:43,502 INFO L226 Difference]: Without dead ends: 987 [2025-03-03 16:20:43,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 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-03-03 16:20:43,503 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1313 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:43,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 808 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:20:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-03-03 16:20:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 932. [2025-03-03 16:20:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 841 states have (on average 1.390011890606421) internal successors, (1169), 845 states have internal predecessors, (1169), 61 states have call successors, (61), 29 states have call predecessors, (61), 28 states have return successors, (76), 58 states have call predecessors, (76), 60 states have call successors, (76) [2025-03-03 16:20:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1306 transitions. [2025-03-03 16:20:43,539 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1306 transitions. Word has length 70 [2025-03-03 16:20:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:43,539 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1306 transitions. [2025-03-03 16:20:43,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-03 16:20:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1306 transitions. [2025-03-03 16:20:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:20:43,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:43,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:43,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:43,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:43,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:43,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:43,746 INFO L85 PathProgramCache]: Analyzing trace with hash -114524191, now seen corresponding path program 1 times [2025-03-03 16:20:43,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:43,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998480499] [2025-03-03 16:20:43,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:43,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:20:43,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:20:43,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:43,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:20:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998480499] [2025-03-03 16:20:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998480499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176688787] [2025-03-03 16:20:43,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:43,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:43,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:43,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:20:43,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:20:43,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:20:43,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:43,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:20:43,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:44,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:20:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:20:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176688787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:20:44,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:20:44,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-03 16:20:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198700126] [2025-03-03 16:20:44,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:20:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:20:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:44,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:20:44,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:20:44,222 INFO L87 Difference]: Start difference. First operand 932 states and 1306 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03-03 16:20:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:44,593 INFO L93 Difference]: Finished difference Result 2160 states and 2926 transitions. [2025-03-03 16:20:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 16:20:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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 71 [2025-03-03 16:20:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:44,602 INFO L225 Difference]: With dead ends: 2160 [2025-03-03 16:20:44,602 INFO L226 Difference]: Without dead ends: 1739 [2025-03-03 16:20:44,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 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-03-03 16:20:44,605 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 927 mSDsluCounter, 4014 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 4821 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:44,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 4821 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:20:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2025-03-03 16:20:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1280. [2025-03-03 16:20:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1155 states have (on average 1.3497835497835498) internal successors, (1559), 1163 states have internal predecessors, (1559), 80 states have call successors, (80), 42 states have call predecessors, (80), 43 states have return successors, (105), 75 states have call predecessors, (105), 79 states have call successors, (105) [2025-03-03 16:20:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1744 transitions. [2025-03-03 16:20:44,673 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1744 transitions. Word has length 71 [2025-03-03 16:20:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:44,673 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1744 transitions. [2025-03-03 16:20:44,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03-03 16:20:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1744 transitions. [2025-03-03 16:20:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:20:44,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:44,675 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2025-03-03 16:20:44,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:44,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 16:20:44,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1078203665, now seen corresponding path program 1 times [2025-03-03 16:20:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559933206] [2025-03-03 16:20:44,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:44,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:20:44,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:20:44,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:44,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 16:20:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:44,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559933206] [2025-03-03 16:20:44,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559933206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:44,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199257198] [2025-03-03 16:20:44,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:44,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:44,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:44,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:44,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:20:45,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:20:45,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:20:45,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:45,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:45,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 16:20:45,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 16:20:45,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199257198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:45,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:45,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690877003] [2025-03-03 16:20:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:45,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:45,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:45,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:45,094 INFO L87 Difference]: Start difference. First operand 1280 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-03-03 16:20:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:45,138 INFO L93 Difference]: Finished difference Result 1873 states and 2512 transitions. [2025-03-03 16:20:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 90 [2025-03-03 16:20:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:45,144 INFO L225 Difference]: With dead ends: 1873 [2025-03-03 16:20:45,145 INFO L226 Difference]: Without dead ends: 1176 [2025-03-03 16:20:45,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 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-03-03 16:20:45,147 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 676 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 823 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-03-03 16:20:45,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 823 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-03 16:20:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1159. [2025-03-03 16:20:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1046 states have (on average 1.3537284894837476) internal successors, (1416), 1055 states have internal predecessors, (1416), 73 states have call successors, (73), 37 states have call predecessors, (73), 38 states have return successors, (95), 67 states have call predecessors, (95), 72 states have call successors, (95) [2025-03-03 16:20:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1584 transitions. [2025-03-03 16:20:45,190 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1584 transitions. Word has length 90 [2025-03-03 16:20:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:45,190 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1584 transitions. [2025-03-03 16:20:45,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-03-03 16:20:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1584 transitions. [2025-03-03 16:20:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:20:45,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:45,193 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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] [2025-03-03 16:20:45,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:45,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:45,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:45,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1716460315, now seen corresponding path program 1 times [2025-03-03 16:20:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:45,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5091406] [2025-03-03 16:20:45,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:45,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:20:45,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:20:45,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:45,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:20:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5091406] [2025-03-03 16:20:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5091406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:20:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317403341] [2025-03-03 16:20:45,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:45,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:45,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:20:45,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:20:45,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:20:45,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:20:45,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:20:45,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:45,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:45,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:20:45,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:20:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:20:45,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:20:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317403341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:20:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 16:20:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998791198] [2025-03-03 16:20:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:20:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:45,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:20:45,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:45,574 INFO L87 Difference]: Start difference. First operand 1159 states and 1584 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-03 16:20:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:45,616 INFO L93 Difference]: Finished difference Result 1477 states and 1978 transitions. [2025-03-03 16:20:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:20:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 105 [2025-03-03 16:20:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:45,618 INFO L225 Difference]: With dead ends: 1477 [2025-03-03 16:20:45,618 INFO L226 Difference]: Without dead ends: 404 [2025-03-03 16:20:45,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 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-03-03 16:20:45,620 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 62 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1450 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-03-03 16:20:45,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1450 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:20:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-03 16:20:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-03-03 16:20:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 371 states have (on average 1.536388140161725) internal successors, (570), 372 states have internal predecessors, (570), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 16:20:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 622 transitions. [2025-03-03 16:20:45,632 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 622 transitions. Word has length 105 [2025-03-03 16:20:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:45,632 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 622 transitions. [2025-03-03 16:20:45,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-03 16:20:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 622 transitions. [2025-03-03 16:20:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:45,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:45,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:45,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:20:45,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:20:45,838 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:45,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1143756948, now seen corresponding path program 1 times [2025-03-03 16:20:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503779981] [2025-03-03 16:20:45,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:45,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:45,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:45,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:45,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503779981] [2025-03-03 16:20:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503779981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947612498] [2025-03-03 16:20:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:45,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:45,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:45,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:45,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:45,945 INFO L87 Difference]: Start difference. First operand 404 states and 622 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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-03-03 16:20:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:46,486 INFO L93 Difference]: Finished difference Result 1218 states and 1892 transitions. [2025-03-03 16:20:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:20:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:46,489 INFO L225 Difference]: With dead ends: 1218 [2025-03-03 16:20:46,489 INFO L226 Difference]: Without dead ends: 835 [2025-03-03 16:20:46,490 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-03-03 16:20:46,491 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1178 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:46,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 1749 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:20:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-03 16:20:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 806. [2025-03-03 16:20:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 745 states have (on average 1.5463087248322147) internal successors, (1152), 747 states have internal predecessors, (1152), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-03 16:20:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1247 transitions. [2025-03-03 16:20:46,515 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1247 transitions. Word has length 178 [2025-03-03 16:20:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:46,515 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1247 transitions. [2025-03-03 16:20:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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-03-03 16:20:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1247 transitions. [2025-03-03 16:20:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:46,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:46,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:46,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:20:46,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:46,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1441719338, now seen corresponding path program 1 times [2025-03-03 16:20:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:46,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131057206] [2025-03-03 16:20:46,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:46,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:46,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:46,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:46,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131057206] [2025-03-03 16:20:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131057206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337701331] [2025-03-03 16:20:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:46,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:46,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:46,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:46,682 INFO L87 Difference]: Start difference. First operand 806 states and 1247 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:47,417 INFO L93 Difference]: Finished difference Result 2099 states and 3287 transitions. [2025-03-03 16:20:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:47,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:47,423 INFO L225 Difference]: With dead ends: 2099 [2025-03-03 16:20:47,423 INFO L226 Difference]: Without dead ends: 1314 [2025-03-03 16:20:47,425 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-03-03 16:20:47,426 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 1188 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:47,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 3410 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-03 16:20:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1181. [2025-03-03 16:20:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1092 states have (on average 1.5384615384615385) internal successors, (1680), 1095 states have internal predecessors, (1680), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-03 16:20:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1820 transitions. [2025-03-03 16:20:47,470 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1820 transitions. Word has length 178 [2025-03-03 16:20:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:47,470 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1820 transitions. [2025-03-03 16:20:47,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1820 transitions. [2025-03-03 16:20:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:47,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:47,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:47,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:20:47,473 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1747353867, now seen corresponding path program 1 times [2025-03-03 16:20:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291008533] [2025-03-03 16:20:47,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:47,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:47,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:47,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:47,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:47,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291008533] [2025-03-03 16:20:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291008533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:47,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:47,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826428376] [2025-03-03 16:20:47,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:47,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:47,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:47,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:47,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:47,627 INFO L87 Difference]: Start difference. First operand 1181 states and 1820 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:48,305 INFO L93 Difference]: Finished difference Result 3294 states and 5145 transitions. [2025-03-03 16:20:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:48,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:48,315 INFO L225 Difference]: With dead ends: 3294 [2025-03-03 16:20:48,315 INFO L226 Difference]: Without dead ends: 2134 [2025-03-03 16:20:48,318 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-03-03 16:20:48,319 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 1183 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:48,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 3394 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2025-03-03 16:20:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1980. [2025-03-03 16:20:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1833 states have (on average 1.5422804146208402) internal successors, (2827), 1840 states have internal predecessors, (2827), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-03 16:20:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 3063 transitions. [2025-03-03 16:20:48,394 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 3063 transitions. Word has length 178 [2025-03-03 16:20:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:48,394 INFO L471 AbstractCegarLoop]: Abstraction has 1980 states and 3063 transitions. [2025-03-03 16:20:48,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 3063 transitions. [2025-03-03 16:20:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:48,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:48,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:48,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:20:48,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:48,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1845017590, now seen corresponding path program 1 times [2025-03-03 16:20:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371376647] [2025-03-03 16:20:48,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:48,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:48,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:48,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:48,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:48,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:48,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371376647] [2025-03-03 16:20:48,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371376647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:48,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494838556] [2025-03-03 16:20:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:48,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:48,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:48,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:48,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:48,568 INFO L87 Difference]: Start difference. First operand 1980 states and 3063 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:49,300 INFO L93 Difference]: Finished difference Result 5875 states and 9246 transitions. [2025-03-03 16:20:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:49,316 INFO L225 Difference]: With dead ends: 5875 [2025-03-03 16:20:49,316 INFO L226 Difference]: Without dead ends: 3916 [2025-03-03 16:20:49,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:20:49,323 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 1178 mSDsluCounter, 2557 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:49,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 3382 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2025-03-03 16:20:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3719. [2025-03-03 16:20:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3450 states have (on average 1.5602898550724638) internal successors, (5383), 3471 states have internal predecessors, (5383), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-03 16:20:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 5835 transitions. [2025-03-03 16:20:49,457 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 5835 transitions. Word has length 178 [2025-03-03 16:20:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:49,457 INFO L471 AbstractCegarLoop]: Abstraction has 3719 states and 5835 transitions. [2025-03-03 16:20:49,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5835 transitions. [2025-03-03 16:20:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:49,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:49,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:49,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:20:49,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1502782763, now seen corresponding path program 1 times [2025-03-03 16:20:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976671670] [2025-03-03 16:20:49,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:49,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:49,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:49,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:49,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976671670] [2025-03-03 16:20:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976671670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202775233] [2025-03-03 16:20:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:49,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:49,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:49,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:49,620 INFO L87 Difference]: Start difference. First operand 3719 states and 5835 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:50,418 INFO L93 Difference]: Finished difference Result 11582 states and 18580 transitions. [2025-03-03 16:20:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:50,452 INFO L225 Difference]: With dead ends: 11582 [2025-03-03 16:20:50,453 INFO L226 Difference]: Without dead ends: 7884 [2025-03-03 16:20:50,466 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-03-03 16:20:50,467 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 1173 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:50,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 3370 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7884 states. [2025-03-03 16:20:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7884 to 7602. [2025-03-03 16:20:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 7071 states have (on average 1.590581247348324) internal successors, (11247), 7138 states have internal predecessors, (11247), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-03 16:20:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 12227 transitions. [2025-03-03 16:20:50,805 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 12227 transitions. Word has length 178 [2025-03-03 16:20:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:50,806 INFO L471 AbstractCegarLoop]: Abstraction has 7602 states and 12227 transitions. [2025-03-03 16:20:50,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 12227 transitions. [2025-03-03 16:20:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:50,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:50,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:20:50,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -779492330, now seen corresponding path program 1 times [2025-03-03 16:20:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667909224] [2025-03-03 16:20:50,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:50,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:50,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:50,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:50,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667909224] [2025-03-03 16:20:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667909224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:50,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:50,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363642055] [2025-03-03 16:20:50,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:50,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:50,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:50,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:50,966 INFO L87 Difference]: Start difference. First operand 7602 states and 12227 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:51,443 INFO L93 Difference]: Finished difference Result 17009 states and 28113 transitions. [2025-03-03 16:20:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:51,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:51,485 INFO L225 Difference]: With dead ends: 17009 [2025-03-03 16:20:51,486 INFO L226 Difference]: Without dead ends: 9428 [2025-03-03 16:20:51,507 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-03-03 16:20:51,508 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 836 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:51,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1255 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:20:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9428 states. [2025-03-03 16:20:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9428 to 7602. [2025-03-03 16:20:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 7071 states have (on average 1.5881770612360344) internal successors, (11230), 7138 states have internal predecessors, (11230), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-03 16:20:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 12210 transitions. [2025-03-03 16:20:51,803 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 12210 transitions. Word has length 178 [2025-03-03 16:20:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 7602 states and 12210 transitions. [2025-03-03 16:20:51,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 12210 transitions. [2025-03-03 16:20:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:51,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:51,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:51,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:20:51,810 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:51,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 906407605, now seen corresponding path program 1 times [2025-03-03 16:20:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:51,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416284121] [2025-03-03 16:20:51,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:51,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:51,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:51,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:51,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416284121] [2025-03-03 16:20:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416284121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:51,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268172186] [2025-03-03 16:20:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:51,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:51,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:51,971 INFO L87 Difference]: Start difference. First operand 7602 states and 12210 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:52,527 INFO L93 Difference]: Finished difference Result 16926 states and 27913 transitions. [2025-03-03 16:20:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:52,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:52,563 INFO L225 Difference]: With dead ends: 16926 [2025-03-03 16:20:52,563 INFO L226 Difference]: Without dead ends: 9345 [2025-03-03 16:20:52,586 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-03-03 16:20:52,586 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 833 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:52,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1247 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:20:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9345 states. [2025-03-03 16:20:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9345 to 7602. [2025-03-03 16:20:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 7071 states have (on average 1.5857728751237448) internal successors, (11213), 7138 states have internal predecessors, (11213), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-03 16:20:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 12193 transitions. [2025-03-03 16:20:53,011 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 12193 transitions. Word has length 178 [2025-03-03 16:20:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:53,011 INFO L471 AbstractCegarLoop]: Abstraction has 7602 states and 12193 transitions. [2025-03-03 16:20:53,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 12193 transitions. [2025-03-03 16:20:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:53,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:53,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:53,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:20:53,016 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:53,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1099338806, now seen corresponding path program 1 times [2025-03-03 16:20:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:53,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985733340] [2025-03-03 16:20:53,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:53,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:53,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:53,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:53,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:53,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:53,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985733340] [2025-03-03 16:20:53,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985733340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:53,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:53,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876647268] [2025-03-03 16:20:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:53,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:53,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:53,170 INFO L87 Difference]: Start difference. First operand 7602 states and 12193 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:54,108 INFO L93 Difference]: Finished difference Result 24257 states and 39920 transitions. [2025-03-03 16:20:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:54,158 INFO L225 Difference]: With dead ends: 24257 [2025-03-03 16:20:54,158 INFO L226 Difference]: Without dead ends: 16676 [2025-03-03 16:20:54,176 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-03-03 16:20:54,176 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 1149 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:54,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 3306 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:20:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2025-03-03 16:20:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 16286. [2025-03-03 16:20:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16286 states, 15177 states have (on average 1.6192264610924425) internal successors, (24575), 15390 states have internal predecessors, (24575), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 16:20:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16286 states to 16286 states and 26995 transitions. [2025-03-03 16:20:54,696 INFO L78 Accepts]: Start accepts. Automaton has 16286 states and 26995 transitions. Word has length 178 [2025-03-03 16:20:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 16286 states and 26995 transitions. [2025-03-03 16:20:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16286 states and 26995 transitions. [2025-03-03 16:20:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:54,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:54,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:54,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:20:54,703 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2064901623, now seen corresponding path program 1 times [2025-03-03 16:20:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206381989] [2025-03-03 16:20:54,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:54,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206381989] [2025-03-03 16:20:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206381989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:20:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558600215] [2025-03-03 16:20:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:20:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:54,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:20:54,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:20:54,791 INFO L87 Difference]: Start difference. First operand 16286 states and 26995 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:55,725 INFO L93 Difference]: Finished difference Result 36961 states and 63131 transitions. [2025-03-03 16:20:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:20:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:55,791 INFO L225 Difference]: With dead ends: 36961 [2025-03-03 16:20:55,792 INFO L226 Difference]: Without dead ends: 20696 [2025-03-03 16:20:55,829 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-03-03 16:20:55,830 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 828 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:55,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1227 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:20:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20696 states. [2025-03-03 16:20:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20696 to 16286. [2025-03-03 16:20:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16286 states, 15177 states have (on average 1.6170521183369573) internal successors, (24542), 15390 states have internal predecessors, (24542), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 16:20:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16286 states to 16286 states and 26962 transitions. [2025-03-03 16:20:56,466 INFO L78 Accepts]: Start accepts. Automaton has 16286 states and 26962 transitions. Word has length 178 [2025-03-03 16:20:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:56,466 INFO L471 AbstractCegarLoop]: Abstraction has 16286 states and 26962 transitions. [2025-03-03 16:20:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 16286 states and 26962 transitions. [2025-03-03 16:20:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:56,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:56,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:56,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:20:56,474 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:56,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1403312150, now seen corresponding path program 1 times [2025-03-03 16:20:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065468654] [2025-03-03 16:20:56,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:56,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:56,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:56,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:56,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:56,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065468654] [2025-03-03 16:20:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065468654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:56,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015996474] [2025-03-03 16:20:56,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:56,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:56,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:56,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:56,599 INFO L87 Difference]: Start difference. First operand 16286 states and 26962 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:20:57,982 INFO L93 Difference]: Finished difference Result 53135 states and 90913 transitions. [2025-03-03 16:20:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:20:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:20:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:20:58,113 INFO L225 Difference]: With dead ends: 53135 [2025-03-03 16:20:58,113 INFO L226 Difference]: Without dead ends: 36870 [2025-03-03 16:20:58,154 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-03-03 16:20:58,156 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 1136 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 3275 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:20:58,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 3275 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:20:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36870 states. [2025-03-03 16:20:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36870 to 36246. [2025-03-03 16:20:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36246 states, 33819 states have (on average 1.6533901061533458) internal successors, (55916), 34486 states have internal predecessors, (55916), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 16:20:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36246 states to 36246 states and 62752 transitions. [2025-03-03 16:20:59,842 INFO L78 Accepts]: Start accepts. Automaton has 36246 states and 62752 transitions. Word has length 178 [2025-03-03 16:20:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:20:59,843 INFO L471 AbstractCegarLoop]: Abstraction has 36246 states and 62752 transitions. [2025-03-03 16:20:59,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:20:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 36246 states and 62752 transitions. [2025-03-03 16:20:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:20:59,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:20:59,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:20:59,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:20:59,854 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:20:59,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:20:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1943165417, now seen corresponding path program 1 times [2025-03-03 16:20:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:20:59,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873857172] [2025-03-03 16:20:59,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:20:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:20:59,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:20:59,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:20:59,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:20:59,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:20:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:20:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:20:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873857172] [2025-03-03 16:20:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873857172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:20:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:20:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:20:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755080233] [2025-03-03 16:20:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:20:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:20:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:20:59,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:20:59,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:20:59,974 INFO L87 Difference]: Start difference. First operand 36246 states and 62752 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:21:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:02,605 INFO L93 Difference]: Finished difference Result 121025 states and 218957 transitions. [2025-03-03 16:21:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:21:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:02,925 INFO L225 Difference]: With dead ends: 121025 [2025-03-03 16:21:02,925 INFO L226 Difference]: Without dead ends: 84800 [2025-03-03 16:21:03,030 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-03-03 16:21:03,031 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1131 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:03,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 3263 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:21:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84800 states. [2025-03-03 16:21:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84800 to 83699. [2025-03-03 16:21:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83699 states, 78150 states have (on average 1.692130518234165) internal successors, (132240), 80211 states have internal predecessors, (132240), 2714 states have call successors, (2714), 774 states have call predecessors, (2714), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-03-03 16:21:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83699 states to 83699 states and 154052 transitions. [2025-03-03 16:21:06,826 INFO L78 Accepts]: Start accepts. Automaton has 83699 states and 154052 transitions. Word has length 178 [2025-03-03 16:21:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:06,826 INFO L471 AbstractCegarLoop]: Abstraction has 83699 states and 154052 transitions. [2025-03-03 16:21:06,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:21:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 83699 states and 154052 transitions. [2025-03-03 16:21:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:21:06,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:06,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:06,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:21:06,846 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:06,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1774021642, now seen corresponding path program 1 times [2025-03-03 16:21:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:06,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330794247] [2025-03-03 16:21:06,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:06,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:06,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:21:06,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:21:06,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:06,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330794247] [2025-03-03 16:21:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330794247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:06,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:06,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:21:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392645905] [2025-03-03 16:21:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:21:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:06,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:21:06,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:06,957 INFO L87 Difference]: Start difference. First operand 83699 states and 154052 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:21:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:10,756 INFO L93 Difference]: Finished difference Result 200212 states and 383815 transitions. [2025-03-03 16:21:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:21:10,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:21:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:11,210 INFO L225 Difference]: With dead ends: 200212 [2025-03-03 16:21:11,211 INFO L226 Difference]: Without dead ends: 116534 [2025-03-03 16:21:11,461 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-03-03 16:21:11,463 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 823 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:11,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1207 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:21:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116534 states. [2025-03-03 16:21:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116534 to 83699. [2025-03-03 16:21:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83699 states, 78150 states have (on average 1.6904798464491362) internal successors, (132111), 80211 states have internal predecessors, (132111), 2714 states have call successors, (2714), 774 states have call predecessors, (2714), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-03-03 16:21:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83699 states to 83699 states and 153923 transitions. [2025-03-03 16:21:16,924 INFO L78 Accepts]: Start accepts. Automaton has 83699 states and 153923 transitions. Word has length 178 [2025-03-03 16:21:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:16,924 INFO L471 AbstractCegarLoop]: Abstraction has 83699 states and 153923 transitions. [2025-03-03 16:21:16,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:21:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 83699 states and 153923 transitions. [2025-03-03 16:21:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 16:21:16,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:16,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:16,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:21:16,939 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 586739255, now seen corresponding path program 1 times [2025-03-03 16:21:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500728772] [2025-03-03 16:21:16,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:16,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 16:21:16,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 16:21:16,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:16,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:17,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500728772] [2025-03-03 16:21:17,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500728772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:17,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:17,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688660410] [2025-03-03 16:21:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:17,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:17,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:17,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:17,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:17,030 INFO L87 Difference]: Start difference. First operand 83699 states and 153923 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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-03-03 16:21:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:23,146 INFO L93 Difference]: Finished difference Result 294492 states and 569577 transitions. [2025-03-03 16:21:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:23,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2025-03-03 16:21:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:24,140 INFO L225 Difference]: With dead ends: 294492 [2025-03-03 16:21:24,140 INFO L226 Difference]: Without dead ends: 210814 [2025-03-03 16:21:24,459 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-03-03 16:21:24,460 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1492 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 3219 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:24,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 3219 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210814 states.