./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.10.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 78201c5527fd684bbb5ce3426a0df19562cff65b8fe2040ac04671f6137326c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:32:01,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:32:01,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:32:01,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:32:01,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:32:01,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:32:01,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:32:01,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:32:01,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:32:01,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:32:01,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:32:01,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:32:01,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:32:01,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:32:01,281 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:32:01,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:32:01,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:32:01,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:32:01,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:32:01,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:32:01,283 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 -> 78201c5527fd684bbb5ce3426a0df19562cff65b8fe2040ac04671f6137326c6 [2025-03-08 07:32:01,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:32:01,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:32:01,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:32:01,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:32:01,489 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:32:01,490 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.10.cil-2.c [2025-03-08 07:32:02,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fb0d509/2334d1e2e14543f988da69394ea72e33/FLAGeef116b39 [2025-03-08 07:32:02,888 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:32:02,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.10.cil-2.c [2025-03-08 07:32:02,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fb0d509/2334d1e2e14543f988da69394ea72e33/FLAGeef116b39 [2025-03-08 07:32:03,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fb0d509/2334d1e2e14543f988da69394ea72e33 [2025-03-08 07:32:03,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:32:03,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:32:03,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:32:03,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:32:03,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:32:03,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2b30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03, skipping insertion in model container [2025-03-08 07:32:03,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:32:03,351 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.10.cil-2.c[913,926] [2025-03-08 07:32:03,396 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.10.cil-2.c[5977,5990] [2025-03-08 07:32:03,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:32:03,504 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:32:03,510 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.10.cil-2.c[913,926] [2025-03-08 07:32:03,525 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.10.cil-2.c[5977,5990] [2025-03-08 07:32:03,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:32:03,590 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:32:03,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03 WrapperNode [2025-03-08 07:32:03,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:32:03,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:32:03,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:32:03,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:32:03,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,634 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 912 [2025-03-08 07:32:03,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:32:03,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:32:03,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:32:03,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:32:03,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,662 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-08 07:32:03,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:32:03,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:32:03,688 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:32:03,688 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:32:03,689 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (1/1) ... [2025-03-08 07:32:03,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:32:03,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:03,715 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-08 07:32:03,719 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-08 07:32:03,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:32:03,735 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:32:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:32:03,736 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:32:03,829 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:32:03,830 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:32:04,628 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-08 07:32:04,628 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:32:04,643 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:32:04,643 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:32:04,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:04 BoogieIcfgContainer [2025-03-08 07:32:04,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:32:04,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:32:04,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:32:04,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:32:04,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:32:03" (1/3) ... [2025-03-08 07:32:04,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6491de26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:04, skipping insertion in model container [2025-03-08 07:32:04,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:03" (2/3) ... [2025-03-08 07:32:04,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6491de26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:04, skipping insertion in model container [2025-03-08 07:32:04,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:04" (3/3) ... [2025-03-08 07:32:04,654 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.10.cil-2.c [2025-03-08 07:32:04,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:32:04,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.10.cil-2.c that has 10 procedures, 398 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-03-08 07:32:04,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:32:04,741 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;@f3d0272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:32:04,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:32:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 398 states, 358 states have (on average 1.594972067039106) internal successors, (571), 361 states have internal predecessors, (571), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 07:32:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 07:32:04,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:04,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:04,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1682762892, now seen corresponding path program 1 times [2025-03-08 07:32:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:04,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766184965] [2025-03-08 07:32:04,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:04,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 07:32:04,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 07:32:04,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:04,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766184965] [2025-03-08 07:32:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766184965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:04,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:04,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899546212] [2025-03-08 07:32:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:04,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:04,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:04,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:04,959 INFO L87 Difference]: Start difference. First operand has 398 states, 358 states have (on average 1.594972067039106) internal successors, (571), 361 states have internal predecessors, (571), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:05,056 INFO L93 Difference]: Finished difference Result 828 states and 1310 transitions. [2025-03-08 07:32:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:05,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 07:32:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:05,067 INFO L225 Difference]: With dead ends: 828 [2025-03-08 07:32:05,067 INFO L226 Difference]: Without dead ends: 443 [2025-03-08 07:32:05,071 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-08 07:32:05,073 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 590 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 702 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-08 07:32:05,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 702 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-08 07:32:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2025-03-08 07:32:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 393 states have (on average 1.5368956743002544) internal successors, (604), 396 states have internal predecessors, (604), 34 states have call successors, (34), 11 states have call predecessors, (34), 10 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2025-03-08 07:32:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 674 transitions. [2025-03-08 07:32:05,137 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 674 transitions. Word has length 41 [2025-03-08 07:32:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:05,138 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 674 transitions. [2025-03-08 07:32:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 674 transitions. [2025-03-08 07:32:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 07:32:05,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:05,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:05,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:32:05,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:05,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1138705231, now seen corresponding path program 1 times [2025-03-08 07:32:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:05,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011038855] [2025-03-08 07:32:05,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:05,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 07:32:05,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 07:32:05,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:05,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:05,244 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-08 07:32:05,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:05,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011038855] [2025-03-08 07:32:05,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011038855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:05,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:05,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:05,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745765307] [2025-03-08 07:32:05,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:05,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:05,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:05,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:05,247 INFO L87 Difference]: Start difference. First operand 439 states and 674 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:05,304 INFO L93 Difference]: Finished difference Result 632 states and 947 transitions. [2025-03-08 07:32:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:05,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-08 07:32:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:05,311 INFO L225 Difference]: With dead ends: 632 [2025-03-08 07:32:05,312 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 07:32:05,313 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-08 07:32:05,313 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 66 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1201 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-08 07:32:05,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1201 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 07:32:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 500. [2025-03-08 07:32:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 448 states have (on average 1.5223214285714286) internal successors, (682), 451 states have internal predecessors, (682), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2025-03-08 07:32:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 759 transitions. [2025-03-08 07:32:05,342 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 759 transitions. Word has length 42 [2025-03-08 07:32:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:05,342 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 759 transitions. [2025-03-08 07:32:05,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 759 transitions. [2025-03-08 07:32:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 07:32:05,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:05,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:05,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:32:05,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:05,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash -492704991, now seen corresponding path program 1 times [2025-03-08 07:32:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534423444] [2025-03-08 07:32:05,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:05,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 07:32:05,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 07:32:05,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:05,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:05,448 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-08 07:32:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534423444] [2025-03-08 07:32:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534423444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:05,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:05,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:05,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622739287] [2025-03-08 07:32:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:05,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:05,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:05,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:05,449 INFO L87 Difference]: Start difference. First operand 500 states and 759 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:05,488 INFO L93 Difference]: Finished difference Result 825 states and 1219 transitions. [2025-03-08 07:32:05,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:05,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 07:32:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:05,492 INFO L225 Difference]: With dead ends: 825 [2025-03-08 07:32:05,493 INFO L226 Difference]: Without dead ends: 657 [2025-03-08 07:32:05,493 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-08 07:32:05,494 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 577 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 683 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-08 07:32:05,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 683 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-08 07:32:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 645. [2025-03-08 07:32:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 575 states have (on average 1.4817391304347827) internal successors, (852), 580 states have internal predecessors, (852), 48 states have call successors, (48), 21 states have call predecessors, (48), 20 states have return successors, (56), 44 states have call predecessors, (56), 46 states have call successors, (56) [2025-03-08 07:32:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 956 transitions. [2025-03-08 07:32:05,528 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 956 transitions. Word has length 43 [2025-03-08 07:32:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 956 transitions. [2025-03-08 07:32:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:32:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 956 transitions. [2025-03-08 07:32:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:32:05,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:05,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:05,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:32:05,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:05,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash 352298948, now seen corresponding path program 1 times [2025-03-08 07:32:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:05,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512745034] [2025-03-08 07:32:05,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:05,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:32:05,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:32:05,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:05,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:32:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512745034] [2025-03-08 07:32:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512745034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:32:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595530378] [2025-03-08 07:32:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:05,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:05,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:05,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:05,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:32:05,621 INFO L87 Difference]: Start difference. First operand 645 states and 956 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:05,674 INFO L93 Difference]: Finished difference Result 1116 states and 1612 transitions. [2025-03-08 07:32:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:05,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-03-08 07:32:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:05,680 INFO L225 Difference]: With dead ends: 1116 [2025-03-08 07:32:05,681 INFO L226 Difference]: Without dead ends: 803 [2025-03-08 07:32:05,682 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-08 07:32:05,683 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 53 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:05,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1243 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-08 07:32:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-08 07:32:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 711 states have (on average 1.431786216596343) internal successors, (1018), 716 states have internal predecessors, (1018), 62 states have call successors, (62), 29 states have call predecessors, (62), 28 states have return successors, (78), 58 states have call predecessors, (78), 60 states have call successors, (78) [2025-03-08 07:32:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1158 transitions. [2025-03-08 07:32:05,729 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1158 transitions. Word has length 58 [2025-03-08 07:32:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:05,730 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1158 transitions. [2025-03-08 07:32:05,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1158 transitions. [2025-03-08 07:32:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:32:05,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:05,734 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-08 07:32:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:32:05,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:05,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash -341516009, now seen corresponding path program 1 times [2025-03-08 07:32:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787031154] [2025-03-08 07:32:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:05,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:05,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:05,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:05,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787031154] [2025-03-08 07:32:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787031154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862783644] [2025-03-08 07:32:05,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:05,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:05,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:05,931 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-08 07:32:05,933 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-08 07:32:05,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:06,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:06,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:06,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:32:06,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:32:06,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862783644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:06,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:32:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861435300] [2025-03-08 07:32:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:06,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:06,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:06,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:06,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:06,090 INFO L87 Difference]: Start difference. First operand 803 states and 1158 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:32:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:06,142 INFO L93 Difference]: Finished difference Result 1305 states and 1835 transitions. [2025-03-08 07:32:06,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:06,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-03-08 07:32:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:06,148 INFO L225 Difference]: With dead ends: 1305 [2025-03-08 07:32:06,148 INFO L226 Difference]: Without dead ends: 922 [2025-03-08 07:32:06,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:06,150 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 556 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:06,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 677 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-08 07:32:06,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-03-08 07:32:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 816 states have (on average 1.4031862745098038) internal successors, (1145), 821 states have internal predecessors, (1145), 70 states have call successors, (70), 35 states have call predecessors, (70), 34 states have return successors, (90), 66 states have call predecessors, (90), 68 states have call successors, (90) [2025-03-08 07:32:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1305 transitions. [2025-03-08 07:32:06,198 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1305 transitions. Word has length 63 [2025-03-08 07:32:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:06,198 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1305 transitions. [2025-03-08 07:32:06,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:32:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1305 transitions. [2025-03-08 07:32:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:32:06,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:06,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:06,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:32:06,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:06,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1329536140, now seen corresponding path program 1 times [2025-03-08 07:32:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321072152] [2025-03-08 07:32:06,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:06,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:06,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:06,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:06,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321072152] [2025-03-08 07:32:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321072152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167945583] [2025-03-08 07:32:06,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:06,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:06,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:06,498 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-08 07:32:06,506 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-08 07:32:06,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:32:06,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:32:06,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:06,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:06,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 07:32:06,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:06,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:32:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167945583] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:06,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:32:06,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 07:32:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195416458] [2025-03-08 07:32:06,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:06,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:32:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:06,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:32:06,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:32:06,742 INFO L87 Difference]: Start difference. First operand 922 states and 1305 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:06,897 INFO L93 Difference]: Finished difference Result 972 states and 1367 transitions. [2025-03-08 07:32:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-03-08 07:32:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:06,901 INFO L225 Difference]: With dead ends: 972 [2025-03-08 07:32:06,901 INFO L226 Difference]: Without dead ends: 969 [2025-03-08 07:32:06,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:32:06,902 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1093 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:06,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 685 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:32:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-08 07:32:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 921. [2025-03-08 07:32:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 816 states have (on average 1.400735294117647) internal successors, (1143), 820 states have internal predecessors, (1143), 69 states have call successors, (69), 35 states have call predecessors, (69), 34 states have return successors, (90), 66 states have call predecessors, (90), 68 states have call successors, (90) [2025-03-08 07:32:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1302 transitions. [2025-03-08 07:32:06,939 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1302 transitions. Word has length 63 [2025-03-08 07:32:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:06,939 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1302 transitions. [2025-03-08 07:32:06,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:32:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1302 transitions. [2025-03-08 07:32:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:32:06,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:06,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:06,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:32:07,144 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,SelfDestructingSolverStorable5 [2025-03-08 07:32:07,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:07,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1733548607, now seen corresponding path program 1 times [2025-03-08 07:32:07,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:07,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006719193] [2025-03-08 07:32:07,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:07,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:32:07,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:32:07,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:07,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:32:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:07,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006719193] [2025-03-08 07:32:07,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006719193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:07,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563680997] [2025-03-08 07:32:07,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:07,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:07,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:07,226 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-08 07:32:07,228 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-08 07:32:07,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:32:07,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:32:07,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:07,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:07,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:32:07,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:07,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:32:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:07,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563680997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:32:07,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:32:07,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-08 07:32:07,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773425253] [2025-03-08 07:32:07,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:32:07,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:32:07,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:07,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:32:07,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:32:07,616 INFO L87 Difference]: Start difference. First operand 921 states and 1302 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:32:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,024 INFO L93 Difference]: Finished difference Result 2158 states and 2979 transitions. [2025-03-08 07:32:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 07:32:08,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 64 [2025-03-08 07:32:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,032 INFO L225 Difference]: With dead ends: 2158 [2025-03-08 07:32:08,032 INFO L226 Difference]: Without dead ends: 1701 [2025-03-08 07:32:08,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:32:08,034 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 1252 mSDsluCounter, 3915 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:08,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 4598 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-03-08 07:32:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1256. [2025-03-08 07:32:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1115 states have (on average 1.3614349775784753) internal successors, (1518), 1124 states have internal predecessors, (1518), 89 states have call successors, (89), 49 states have call predecessors, (89), 50 states have return successors, (121), 83 states have call predecessors, (121), 88 states have call successors, (121) [2025-03-08 07:32:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1728 transitions. [2025-03-08 07:32:08,124 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1728 transitions. Word has length 64 [2025-03-08 07:32:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,125 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1728 transitions. [2025-03-08 07:32:08,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:32:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1728 transitions. [2025-03-08 07:32:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:32:08,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,130 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:08,138 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-08 07:32:08,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:08,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,334 INFO L85 PathProgramCache]: Analyzing trace with hash -810914085, now seen corresponding path program 1 times [2025-03-08 07:32:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901413922] [2025-03-08 07:32:08,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:32:08,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:32:08,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 07:32:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901413922] [2025-03-08 07:32:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901413922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787502325] [2025-03-08 07:32:08,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:08,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:08,414 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-08 07:32:08,415 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-08 07:32:08,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:32:08,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:32:08,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 07:32:08,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:32:08,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787502325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:32:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941163227] [2025-03-08 07:32:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:08,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:08,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:08,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:08,532 INFO L87 Difference]: Start difference. First operand 1256 states and 1728 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:32:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:08,578 INFO L93 Difference]: Finished difference Result 1856 states and 2523 transitions. [2025-03-08 07:32:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:08,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-03-08 07:32:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:08,583 INFO L225 Difference]: With dead ends: 1856 [2025-03-08 07:32:08,583 INFO L226 Difference]: Without dead ends: 1144 [2025-03-08 07:32:08,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:08,585 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 561 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 699 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-08 07:32:08,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 699 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-08 07:32:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1135. [2025-03-08 07:32:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1008 states have (on average 1.3630952380952381) internal successors, (1374), 1018 states have internal predecessors, (1374), 81 states have call successors, (81), 43 states have call predecessors, (81), 44 states have return successors, (109), 74 states have call predecessors, (109), 80 states have call successors, (109) [2025-03-08 07:32:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1564 transitions. [2025-03-08 07:32:08,668 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1564 transitions. Word has length 82 [2025-03-08 07:32:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:08,668 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1564 transitions. [2025-03-08 07:32:08,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:32:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1564 transitions. [2025-03-08 07:32:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 07:32:08,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:08,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:08,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 07:32:08,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:08,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash -194893397, now seen corresponding path program 1 times [2025-03-08 07:32:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:08,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108106823] [2025-03-08 07:32:08,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:08,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:08,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:08,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 07:32:08,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108106823] [2025-03-08 07:32:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108106823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:32:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558944601] [2025-03-08 07:32:08,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:08,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:08,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:32:08,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:32:08,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:32:08,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:32:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:32:09,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:32:09,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:32:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 07:32:09,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:32:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558944601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:09,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:32:09,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:32:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346932234] [2025-03-08 07:32:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:09,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:32:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:09,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:32:09,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:09,049 INFO L87 Difference]: Start difference. First operand 1135 states and 1564 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 07:32:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:09,085 INFO L93 Difference]: Finished difference Result 1484 states and 2005 transitions. [2025-03-08 07:32:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:32:09,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 96 [2025-03-08 07:32:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:09,088 INFO L225 Difference]: With dead ends: 1484 [2025-03-08 07:32:09,088 INFO L226 Difference]: Without dead ends: 326 [2025-03-08 07:32:09,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:09,090 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 60 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1217 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-08 07:32:09,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1217 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:32:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-08 07:32:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-08 07:32:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 295 states have (on average 1.5728813559322035) internal successors, (464), 296 states have internal predecessors, (464), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 07:32:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 512 transitions. [2025-03-08 07:32:09,102 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 512 transitions. Word has length 96 [2025-03-08 07:32:09,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:09,102 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 512 transitions. [2025-03-08 07:32:09,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 07:32:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 512 transitions. [2025-03-08 07:32:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:09,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:09,103 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] [2025-03-08 07:32:09,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 07:32:09,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:32:09,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:09,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2050907896, now seen corresponding path program 1 times [2025-03-08 07:32:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034015557] [2025-03-08 07:32:09,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:09,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:09,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:09,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:09,443 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-08 07:32:09,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:09,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034015557] [2025-03-08 07:32:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034015557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:09,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:09,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638190169] [2025-03-08 07:32:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:09,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:09,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:09,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:09,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:09,445 INFO L87 Difference]: Start difference. First operand 326 states and 512 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:09,900 INFO L93 Difference]: Finished difference Result 980 states and 1554 transitions. [2025-03-08 07:32:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:32:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:09,904 INFO L225 Difference]: With dead ends: 980 [2025-03-08 07:32:09,904 INFO L226 Difference]: Without dead ends: 673 [2025-03-08 07:32:09,905 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-08 07:32:09,906 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 980 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:09,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1405 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:32:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-08 07:32:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 648. [2025-03-08 07:32:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 591 states have (on average 1.583756345177665) internal successors, (936), 593 states have internal predecessors, (936), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (44), 43 states have call predecessors, (44), 43 states have call successors, (44) [2025-03-08 07:32:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1023 transitions. [2025-03-08 07:32:09,926 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1023 transitions. Word has length 154 [2025-03-08 07:32:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:09,926 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1023 transitions. [2025-03-08 07:32:09,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1023 transitions. [2025-03-08 07:32:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:09,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:09,927 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] [2025-03-08 07:32:09,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:32:09,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:09,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1503109066, now seen corresponding path program 1 times [2025-03-08 07:32:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220337399] [2025-03-08 07:32:09,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:09,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:09,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:09,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:09,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:10,067 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-08 07:32:10,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220337399] [2025-03-08 07:32:10,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220337399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:10,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:10,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964357230] [2025-03-08 07:32:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:10,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:10,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:10,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:10,069 INFO L87 Difference]: Start difference. First operand 648 states and 1023 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:10,689 INFO L93 Difference]: Finished difference Result 1689 states and 2697 transitions. [2025-03-08 07:32:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:10,695 INFO L225 Difference]: With dead ends: 1689 [2025-03-08 07:32:10,695 INFO L226 Difference]: Without dead ends: 1060 [2025-03-08 07:32:10,696 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-08 07:32:10,697 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 986 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:10,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 2700 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-03-08 07:32:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 947. [2025-03-08 07:32:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 864 states have (on average 1.5763888888888888) internal successors, (1362), 867 states have internal predecessors, (1362), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (66), 63 states have call predecessors, (66), 62 states have call successors, (66) [2025-03-08 07:32:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1490 transitions. [2025-03-08 07:32:10,738 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1490 transitions. Word has length 154 [2025-03-08 07:32:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:10,738 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1490 transitions. [2025-03-08 07:32:10,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1490 transitions. [2025-03-08 07:32:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:10,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:10,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:32:10,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:32:10,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:10,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1647518761, now seen corresponding path program 1 times [2025-03-08 07:32:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691620392] [2025-03-08 07:32:10,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:10,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:10,879 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-08 07:32:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691620392] [2025-03-08 07:32:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691620392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:10,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:10,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771237087] [2025-03-08 07:32:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:10,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:10,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:10,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:10,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:10,881 INFO L87 Difference]: Start difference. First operand 947 states and 1490 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:11,500 INFO L93 Difference]: Finished difference Result 2644 states and 4213 transitions. [2025-03-08 07:32:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:11,507 INFO L225 Difference]: With dead ends: 2644 [2025-03-08 07:32:11,507 INFO L226 Difference]: Without dead ends: 1716 [2025-03-08 07:32:11,509 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-08 07:32:11,510 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 981 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:11,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 2684 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2025-03-08 07:32:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1586. [2025-03-08 07:32:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1449 states have (on average 1.5797101449275361) internal successors, (2289), 1456 states have internal predecessors, (2289), 100 states have call successors, (100), 30 states have call predecessors, (100), 36 states have return successors, (116), 103 states have call predecessors, (116), 100 states have call successors, (116) [2025-03-08 07:32:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2505 transitions. [2025-03-08 07:32:11,565 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2505 transitions. Word has length 154 [2025-03-08 07:32:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:11,565 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 2505 transitions. [2025-03-08 07:32:11,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2505 transitions. [2025-03-08 07:32:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:11,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:11,567 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] [2025-03-08 07:32:11,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:32:11,568 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:11,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1375082474, now seen corresponding path program 1 times [2025-03-08 07:32:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329999321] [2025-03-08 07:32:11,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:11,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:11,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:11,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:11,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:11,714 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-08 07:32:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329999321] [2025-03-08 07:32:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329999321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:11,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536718837] [2025-03-08 07:32:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:11,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:11,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:11,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:11,716 INFO L87 Difference]: Start difference. First operand 1586 states and 2505 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:12,391 INFO L93 Difference]: Finished difference Result 4697 states and 7534 transitions. [2025-03-08 07:32:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:12,403 INFO L225 Difference]: With dead ends: 4697 [2025-03-08 07:32:12,403 INFO L226 Difference]: Without dead ends: 3130 [2025-03-08 07:32:12,407 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-08 07:32:12,407 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 973 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:12,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 2658 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2025-03-08 07:32:12,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2972. [2025-03-08 07:32:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2721 states have (on average 1.5946343256155826) internal successors, (4339), 2742 states have internal predecessors, (4339), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-03-08 07:32:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4755 transitions. [2025-03-08 07:32:12,511 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4755 transitions. Word has length 154 [2025-03-08 07:32:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:12,512 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 4755 transitions. [2025-03-08 07:32:12,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4755 transitions. [2025-03-08 07:32:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:12,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:12,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:12,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:32:12,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 901056491, now seen corresponding path program 1 times [2025-03-08 07:32:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521738291] [2025-03-08 07:32:12,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:12,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:12,636 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-08 07:32:12,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:12,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521738291] [2025-03-08 07:32:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521738291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:12,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663455577] [2025-03-08 07:32:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:12,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:12,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:12,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:12,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:12,638 INFO L87 Difference]: Start difference. First operand 2972 states and 4755 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:12,989 INFO L93 Difference]: Finished difference Result 6447 states and 10519 transitions. [2025-03-08 07:32:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:13,004 INFO L225 Difference]: With dead ends: 6447 [2025-03-08 07:32:13,004 INFO L226 Difference]: Without dead ends: 3494 [2025-03-08 07:32:13,012 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-08 07:32:13,013 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 690 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:13,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 999 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2025-03-08 07:32:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 2972. [2025-03-08 07:32:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2721 states have (on average 1.5913267181183388) internal successors, (4330), 2742 states have internal predecessors, (4330), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-03-08 07:32:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4746 transitions. [2025-03-08 07:32:13,144 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4746 transitions. Word has length 154 [2025-03-08 07:32:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:13,144 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 4746 transitions. [2025-03-08 07:32:13,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4746 transitions. [2025-03-08 07:32:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:13,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:13,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:13,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:32:13,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash 608670666, now seen corresponding path program 1 times [2025-03-08 07:32:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:13,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931474777] [2025-03-08 07:32:13,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:13,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:13,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:13,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:13,243 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-08 07:32:13,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931474777] [2025-03-08 07:32:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931474777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:13,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:13,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59993039] [2025-03-08 07:32:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:13,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:13,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:13,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:13,245 INFO L87 Difference]: Start difference. First operand 2972 states and 4746 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:13,758 INFO L93 Difference]: Finished difference Result 6418 states and 10443 transitions. [2025-03-08 07:32:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:13,773 INFO L225 Difference]: With dead ends: 6418 [2025-03-08 07:32:13,774 INFO L226 Difference]: Without dead ends: 3465 [2025-03-08 07:32:13,782 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-08 07:32:13,783 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 687 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:13,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 991 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:32:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2025-03-08 07:32:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2972. [2025-03-08 07:32:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2721 states have (on average 1.5880191106210952) internal successors, (4321), 2742 states have internal predecessors, (4321), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-03-08 07:32:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4737 transitions. [2025-03-08 07:32:13,917 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4737 transitions. Word has length 154 [2025-03-08 07:32:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:13,917 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 4737 transitions. [2025-03-08 07:32:13,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4737 transitions. [2025-03-08 07:32:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:13,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:13,919 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] [2025-03-08 07:32:13,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:32:13,919 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:13,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1756065781, now seen corresponding path program 1 times [2025-03-08 07:32:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950932166] [2025-03-08 07:32:13,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:13,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:14,025 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-08 07:32:14,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950932166] [2025-03-08 07:32:14,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950932166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:14,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:14,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:14,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128951409] [2025-03-08 07:32:14,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:14,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:14,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:14,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:14,027 INFO L87 Difference]: Start difference. First operand 2972 states and 4737 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:14,347 INFO L93 Difference]: Finished difference Result 6389 states and 10367 transitions. [2025-03-08 07:32:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:14,362 INFO L225 Difference]: With dead ends: 6389 [2025-03-08 07:32:14,362 INFO L226 Difference]: Without dead ends: 3436 [2025-03-08 07:32:14,373 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-08 07:32:14,374 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 684 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:14,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 983 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2025-03-08 07:32:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 2972. [2025-03-08 07:32:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2721 states have (on average 1.5847115031238515) internal successors, (4312), 2742 states have internal predecessors, (4312), 176 states have call successors, (176), 54 states have call predecessors, (176), 74 states have return successors, (240), 183 states have call predecessors, (240), 176 states have call successors, (240) [2025-03-08 07:32:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4728 transitions. [2025-03-08 07:32:14,500 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4728 transitions. Word has length 154 [2025-03-08 07:32:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:14,500 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 4728 transitions. [2025-03-08 07:32:14,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4728 transitions. [2025-03-08 07:32:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:14,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:14,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:14,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:32:14,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:14,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1970894934, now seen corresponding path program 1 times [2025-03-08 07:32:14,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:14,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782817861] [2025-03-08 07:32:14,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:14,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:14,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:14,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:14,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:14,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782817861] [2025-03-08 07:32:14,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782817861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:14,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:14,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029181543] [2025-03-08 07:32:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:14,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:14,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:14,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:14,616 INFO L87 Difference]: Start difference. First operand 2972 states and 4728 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:15,352 INFO L93 Difference]: Finished difference Result 9121 states and 14773 transitions. [2025-03-08 07:32:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:15,374 INFO L225 Difference]: With dead ends: 9121 [2025-03-08 07:32:15,374 INFO L226 Difference]: Without dead ends: 6168 [2025-03-08 07:32:15,381 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-08 07:32:15,382 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 944 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:15,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 2589 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2025-03-08 07:32:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 5978. [2025-03-08 07:32:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5978 states, 5481 states have (on average 1.605181536216019) internal successors, (8798), 5548 states have internal predecessors, (8798), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-03-08 07:32:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5978 states to 5978 states and 9710 transitions. [2025-03-08 07:32:15,662 INFO L78 Accepts]: Start accepts. Automaton has 5978 states and 9710 transitions. Word has length 154 [2025-03-08 07:32:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:15,663 INFO L471 AbstractCegarLoop]: Abstraction has 5978 states and 9710 transitions. [2025-03-08 07:32:15,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5978 states and 9710 transitions. [2025-03-08 07:32:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:15,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:15,667 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] [2025-03-08 07:32:15,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:32:15,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:15,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash -176709589, now seen corresponding path program 1 times [2025-03-08 07:32:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:15,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436462619] [2025-03-08 07:32:15,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:15,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:15,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:15,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:15,781 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-08 07:32:15,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436462619] [2025-03-08 07:32:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436462619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:15,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:15,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:32:15,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551359323] [2025-03-08 07:32:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:15,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:32:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:15,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:32:15,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:32:15,785 INFO L87 Difference]: Start difference. First operand 5978 states and 9710 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:16,267 INFO L93 Difference]: Finished difference Result 13099 states and 21755 transitions. [2025-03-08 07:32:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:32:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:16,314 INFO L225 Difference]: With dead ends: 13099 [2025-03-08 07:32:16,314 INFO L226 Difference]: Without dead ends: 7140 [2025-03-08 07:32:16,328 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-08 07:32:16,329 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 680 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:16,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 969 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:32:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7140 states. [2025-03-08 07:32:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7140 to 5978. [2025-03-08 07:32:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5978 states, 5481 states have (on average 1.60207991242474) internal successors, (8781), 5548 states have internal predecessors, (8781), 328 states have call successors, (328), 102 states have call predecessors, (328), 168 states have return successors, (584), 343 states have call predecessors, (584), 328 states have call successors, (584) [2025-03-08 07:32:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5978 states to 5978 states and 9693 transitions. [2025-03-08 07:32:16,700 INFO L78 Accepts]: Start accepts. Automaton has 5978 states and 9693 transitions. Word has length 154 [2025-03-08 07:32:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:16,700 INFO L471 AbstractCegarLoop]: Abstraction has 5978 states and 9693 transitions. [2025-03-08 07:32:16,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5978 states and 9693 transitions. [2025-03-08 07:32:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:16,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:16,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:16,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:32:16,704 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:16,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 296809354, now seen corresponding path program 1 times [2025-03-08 07:32:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959111463] [2025-03-08 07:32:16,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:16,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:16,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:16,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:16,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:16,805 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-08 07:32:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959111463] [2025-03-08 07:32:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959111463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55420770] [2025-03-08 07:32:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:16,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:16,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:16,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:16,808 INFO L87 Difference]: Start difference. First operand 5978 states and 9693 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:17,887 INFO L93 Difference]: Finished difference Result 18869 states and 31342 transitions. [2025-03-08 07:32:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:17,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:17,935 INFO L225 Difference]: With dead ends: 18869 [2025-03-08 07:32:17,936 INFO L226 Difference]: Without dead ends: 12910 [2025-03-08 07:32:17,958 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-08 07:32:17,958 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 931 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:17,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2558 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12910 states. [2025-03-08 07:32:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12910 to 12638. [2025-03-08 07:32:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12638 states, 11595 states have (on average 1.6268219059939628) internal successors, (18863), 11808 states have internal predecessors, (18863), 632 states have call successors, (632), 198 states have call predecessors, (632), 410 states have return successors, (1656), 663 states have call predecessors, (1656), 632 states have call successors, (1656) [2025-03-08 07:32:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12638 states to 12638 states and 21151 transitions. [2025-03-08 07:32:18,496 INFO L78 Accepts]: Start accepts. Automaton has 12638 states and 21151 transitions. Word has length 154 [2025-03-08 07:32:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:18,496 INFO L471 AbstractCegarLoop]: Abstraction has 12638 states and 21151 transitions. [2025-03-08 07:32:18,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 12638 states and 21151 transitions. [2025-03-08 07:32:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:18,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:18,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:32:18,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:32:18,504 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:18,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:18,505 INFO L85 PathProgramCache]: Analyzing trace with hash 727726155, now seen corresponding path program 1 times [2025-03-08 07:32:18,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:18,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749329892] [2025-03-08 07:32:18,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:18,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:18,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:18,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:18,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:18,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:18,614 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-08 07:32:18,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:18,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749329892] [2025-03-08 07:32:18,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749329892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:18,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:18,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:18,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460146675] [2025-03-08 07:32:18,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:18,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:18,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:18,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:18,616 INFO L87 Difference]: Start difference. First operand 12638 states and 21151 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:20,076 INFO L93 Difference]: Finished difference Result 42751 states and 73595 transitions. [2025-03-08 07:32:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:20,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:20,195 INFO L225 Difference]: With dead ends: 42751 [2025-03-08 07:32:20,196 INFO L226 Difference]: Without dead ends: 30132 [2025-03-08 07:32:20,233 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-08 07:32:20,233 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 1206 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:20,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 2515 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:32:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30132 states. [2025-03-08 07:32:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30132 to 27354. [2025-03-08 07:32:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27354 states, 25089 states have (on average 1.6531946271274263) internal successors, (41477), 25756 states have internal predecessors, (41477), 1208 states have call successors, (1208), 390 states have call predecessors, (1208), 1056 states have return successors, (5304), 1271 states have call predecessors, (5304), 1208 states have call successors, (5304) [2025-03-08 07:32:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27354 states to 27354 states and 47989 transitions. [2025-03-08 07:32:21,505 INFO L78 Accepts]: Start accepts. Automaton has 27354 states and 47989 transitions. Word has length 154 [2025-03-08 07:32:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:21,505 INFO L471 AbstractCegarLoop]: Abstraction has 27354 states and 47989 transitions. [2025-03-08 07:32:21,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 27354 states and 47989 transitions. [2025-03-08 07:32:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:21,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:21,515 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] [2025-03-08 07:32:21,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:32:21,516 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1175733940, now seen corresponding path program 1 times [2025-03-08 07:32:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872793751] [2025-03-08 07:32:21,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:21,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:21,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:21,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:21,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:21,737 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-08 07:32:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872793751] [2025-03-08 07:32:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872793751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64834493] [2025-03-08 07:32:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:21,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:21,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:21,740 INFO L87 Difference]: Start difference. First operand 27354 states and 47989 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:24,974 INFO L93 Difference]: Finished difference Result 93561 states and 171287 transitions. [2025-03-08 07:32:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:25,298 INFO L225 Difference]: With dead ends: 93561 [2025-03-08 07:32:25,298 INFO L226 Difference]: Without dead ends: 66226 [2025-03-08 07:32:25,398 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-08 07:32:25,399 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 1172 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:25,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2507 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66226 states. [2025-03-08 07:32:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66226 to 61435. [2025-03-08 07:32:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61435 states, 56272 states have (on average 1.6812802104065965) internal successors, (94609), 58333 states have internal predecessors, (94609), 2328 states have call successors, (2328), 774 states have call predecessors, (2328), 2834 states have return successors, (18712), 2455 states have call predecessors, (18712), 2328 states have call successors, (18712) [2025-03-08 07:32:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61435 states to 61435 states and 115649 transitions. [2025-03-08 07:32:28,459 INFO L78 Accepts]: Start accepts. Automaton has 61435 states and 115649 transitions. Word has length 154 [2025-03-08 07:32:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:28,459 INFO L471 AbstractCegarLoop]: Abstraction has 61435 states and 115649 transitions. [2025-03-08 07:32:28,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 61435 states and 115649 transitions. [2025-03-08 07:32:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:28,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:28,474 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] [2025-03-08 07:32:28,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:32:28,474 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 425432107, now seen corresponding path program 1 times [2025-03-08 07:32:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:28,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229509492] [2025-03-08 07:32:28,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:28,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:28,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:28,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:28,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:28,559 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-08 07:32:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:28,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229509492] [2025-03-08 07:32:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229509492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868918067] [2025-03-08 07:32:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:28,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:28,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:28,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:28,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:28,561 INFO L87 Difference]: Start difference. First operand 61435 states and 115649 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:32:35,093 INFO L93 Difference]: Finished difference Result 211714 states and 424913 transitions. [2025-03-08 07:32:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:32:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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 154 [2025-03-08 07:32:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:32:35,937 INFO L225 Difference]: With dead ends: 211714 [2025-03-08 07:32:35,937 INFO L226 Difference]: Without dead ends: 150298 [2025-03-08 07:32:36,186 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-08 07:32:36,187 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1137 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:32:36,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 2495 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:32:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150298 states. [2025-03-08 07:32:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150298 to 141798. [2025-03-08 07:32:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141798 states, 129445 states have (on average 1.7080072617714086) internal successors, (221093), 135752 states have internal predecessors, (221093), 4504 states have call successors, (4504), 1542 states have call predecessors, (4504), 7848 states have return successors, (70040), 4759 states have call predecessors, (70040), 4504 states have call successors, (70040) [2025-03-08 07:32:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141798 states to 141798 states and 295637 transitions. [2025-03-08 07:32:44,257 INFO L78 Accepts]: Start accepts. Automaton has 141798 states and 295637 transitions. Word has length 154 [2025-03-08 07:32:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:32:44,257 INFO L471 AbstractCegarLoop]: Abstraction has 141798 states and 295637 transitions. [2025-03-08 07:32:44,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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-08 07:32:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 141798 states and 295637 transitions. [2025-03-08 07:32:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 07:32:44,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:32:44,287 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] [2025-03-08 07:32:44,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:32:44,287 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:32:44,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:32:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -215654036, now seen corresponding path program 1 times [2025-03-08 07:32:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:32:44,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573196552] [2025-03-08 07:32:44,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:32:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:32:44,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 07:32:44,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 07:32:44,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:32:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:32:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:32:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:32:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573196552] [2025-03-08 07:32:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573196552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:32:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:32:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:32:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130675450] [2025-03-08 07:32:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:32:44,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:32:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:32:44,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:32:44,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:32:44,377 INFO L87 Difference]: Start difference. First operand 141798 states and 295637 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (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)