./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.04.cil-1.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 056b77142139934f04c5cd96553e37eaed588abf60608a3beeeec0aa5c00ccfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:46:03,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:46:03,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:46:03,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:46:03,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:46:03,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:46:03,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:46:03,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:46:03,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:46:03,733 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:46:03,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:46:03,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:46:03,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:46:03,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:46:03,733 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:46:03,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:46:03,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:46:03,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:03,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:46:03,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:46:03,735 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 -> 056b77142139934f04c5cd96553e37eaed588abf60608a3beeeec0aa5c00ccfe [2025-03-03 15:46:03,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:46:03,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:46:03,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:46:03,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:46:03,966 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:46:03,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.04.cil-1.c [2025-03-03 15:46:05,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e207d8a33/76ca176e698d4d208f6466a410e9630b/FLAG464289c03 [2025-03-03 15:46:05,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:46:05,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.04.cil-1.c [2025-03-03 15:46:05,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e207d8a33/76ca176e698d4d208f6466a410e9630b/FLAG464289c03 [2025-03-03 15:46:05,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e207d8a33/76ca176e698d4d208f6466a410e9630b [2025-03-03 15:46:05,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:46:05,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:46:05,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:05,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:46:05,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:46:05,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:05" (1/1) ... [2025-03-03 15:46:05,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82f62cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:05, skipping insertion in model container [2025-03-03 15:46:05,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:05" (1/1) ... [2025-03-03 15:46:05,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:46:06,983 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/Problem05_label47+token_ring.04.cil-1.c[377612,377625] [2025-03-03 15:46:07,008 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/Problem05_label47+token_ring.04.cil-1.c[383339,383352] [2025-03-03 15:46:07,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:07,192 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:46:07,648 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/Problem05_label47+token_ring.04.cil-1.c[377612,377625] [2025-03-03 15:46:07,653 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/Problem05_label47+token_ring.04.cil-1.c[383339,383352] [2025-03-03 15:46:07,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:07,706 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:46:07,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07 WrapperNode [2025-03-03 15:46:07,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:07,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:07,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:46:07,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:46:07,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:07,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,129 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12729 [2025-03-03 15:46:08,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:08,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:46:08,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:46:08,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:46:08,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:46:08,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:46:08,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:46:08,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:46:08,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:46:08,493 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:08,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:46:08,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:46:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:46:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:46:08,544 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:46:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:46:08,544 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:46:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:46:08,544 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:46:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:46:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:46:08,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:46:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:46:08,545 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:46:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:46:08,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:46:08,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:46:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:46:08,636 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:46:08,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:46:14,649 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:46:14,649 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:46:14,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:46:14,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:46:14,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:46:14,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:46:14,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:46:14,981 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2025-03-03 15:46:14,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:46:15,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:46:15,046 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:46:15,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:15 BoogieIcfgContainer [2025-03-03 15:46:15,046 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:46:15,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:46:15,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:46:15,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:46:15,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:46:05" (1/3) ... [2025-03-03 15:46:15,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2d5835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:15, skipping insertion in model container [2025-03-03 15:46:15,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (2/3) ... [2025-03-03 15:46:15,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2d5835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:15, skipping insertion in model container [2025-03-03 15:46:15,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:15" (3/3) ... [2025-03-03 15:46:15,054 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.04.cil-1.c [2025-03-03 15:46:15,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:46:15,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.04.cil-1.c that has 7 procedures, 2375 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-03-03 15:46:15,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:46:15,173 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;@5c2bd1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:46:15,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:46:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 15:46:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:15,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:15,194 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] [2025-03-03 15:46:15,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:15,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2045429622, now seen corresponding path program 1 times [2025-03-03 15:46:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:15,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137876208] [2025-03-03 15:46:15,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:15,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:15,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:15,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:15,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:15,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:15,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137876208] [2025-03-03 15:46:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137876208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:15,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993455815] [2025-03-03 15:46:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:15,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:15,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:15,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:15,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:15,634 INFO L87 Difference]: Start difference. First operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:16,126 INFO L93 Difference]: Finished difference Result 4932 states and 9029 transitions. [2025-03-03 15:46:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:46:16,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:16,149 INFO L225 Difference]: With dead ends: 4932 [2025-03-03 15:46:16,149 INFO L226 Difference]: Without dead ends: 2499 [2025-03-03 15:46:16,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:16,164 INFO L435 NwaCegarLoop]: 4244 mSDtfsCounter, 4506 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4518 SdHoareTripleChecker+Valid, 12843 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:16,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 12843 Invalid, 344 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-03-03 15:46:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2486. [2025-03-03 15:46:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8184426229508197) internal successors, (4437), 2443 states have internal predecessors, (4437), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-03 15:46:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4500 transitions. [2025-03-03 15:46:16,370 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4500 transitions. Word has length 90 [2025-03-03 15:46:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:16,371 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4500 transitions. [2025-03-03 15:46:16,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4500 transitions. [2025-03-03 15:46:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:16,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:16,376 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] [2025-03-03 15:46:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:46:16,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:16,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -689383752, now seen corresponding path program 1 times [2025-03-03 15:46:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829609407] [2025-03-03 15:46:16,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:16,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:16,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:16,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:16,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829609407] [2025-03-03 15:46:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829609407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730486394] [2025-03-03 15:46:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:16,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:16,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:16,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:16,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:16,557 INFO L87 Difference]: Start difference. First operand 2486 states and 4500 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:16,793 INFO L93 Difference]: Finished difference Result 2869 states and 5081 transitions. [2025-03-03 15:46:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:16,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:16,806 INFO L225 Difference]: With dead ends: 2869 [2025-03-03 15:46:16,806 INFO L226 Difference]: Without dead ends: 2516 [2025-03-03 15:46:16,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:16,810 INFO L435 NwaCegarLoop]: 4163 mSDtfsCounter, 4309 mSDsluCounter, 8251 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 12414 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:16,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 12414 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-03-03 15:46:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2486. [2025-03-03 15:46:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8176229508196722) internal successors, (4435), 2443 states have internal predecessors, (4435), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-03 15:46:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4498 transitions. [2025-03-03 15:46:16,870 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4498 transitions. Word has length 90 [2025-03-03 15:46:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:16,871 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4498 transitions. [2025-03-03 15:46:16,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4498 transitions. [2025-03-03 15:46:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:16,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:16,874 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] [2025-03-03 15:46:16,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:46:16,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -245772329, now seen corresponding path program 1 times [2025-03-03 15:46:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858649541] [2025-03-03 15:46:16,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:16,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858649541] [2025-03-03 15:46:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858649541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:17,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496372143] [2025-03-03 15:46:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:17,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:17,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:17,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:17,005 INFO L87 Difference]: Start difference. First operand 2486 states and 4498 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:17,418 INFO L93 Difference]: Finished difference Result 3054 states and 5348 transitions. [2025-03-03 15:46:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:17,429 INFO L225 Difference]: With dead ends: 3054 [2025-03-03 15:46:17,430 INFO L226 Difference]: Without dead ends: 2701 [2025-03-03 15:46:17,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:17,431 INFO L435 NwaCegarLoop]: 4312 mSDtfsCounter, 4425 mSDsluCounter, 12931 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 17243 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:17,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 17243 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-03 15:46:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2652. [2025-03-03 15:46:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2586 states have (on average 1.797370456303171) internal successors, (4648), 2590 states have internal predecessors, (4648), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-03 15:46:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 4740 transitions. [2025-03-03 15:46:17,494 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 4740 transitions. Word has length 90 [2025-03-03 15:46:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:17,495 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 4740 transitions. [2025-03-03 15:46:17,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 4740 transitions. [2025-03-03 15:46:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:17,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:17,496 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] [2025-03-03 15:46:17,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:46:17,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:17,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:17,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1201293608, now seen corresponding path program 1 times [2025-03-03 15:46:17,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:17,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728163874] [2025-03-03 15:46:17,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728163874] [2025-03-03 15:46:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728163874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:17,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:17,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501966557] [2025-03-03 15:46:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:17,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:17,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:17,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:17,627 INFO L87 Difference]: Start difference. First operand 2652 states and 4740 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:18,067 INFO L93 Difference]: Finished difference Result 3571 states and 6111 transitions. [2025-03-03 15:46:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:18,081 INFO L225 Difference]: With dead ends: 3571 [2025-03-03 15:46:18,082 INFO L226 Difference]: Without dead ends: 3052 [2025-03-03 15:46:18,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:18,088 INFO L435 NwaCegarLoop]: 4308 mSDtfsCounter, 4420 mSDsluCounter, 12919 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4432 SdHoareTripleChecker+Valid, 17227 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:18,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4432 Valid, 17227 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-03-03 15:46:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2999. [2025-03-03 15:46:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2891 states have (on average 1.763057765479073) internal successors, (5097), 2899 states have internal predecessors, (5097), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-03 15:46:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5253 transitions. [2025-03-03 15:46:18,156 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5253 transitions. Word has length 90 [2025-03-03 15:46:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:18,156 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 5253 transitions. [2025-03-03 15:46:18,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5253 transitions. [2025-03-03 15:46:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:18,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:18,158 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] [2025-03-03 15:46:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:46:18,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash 984640439, now seen corresponding path program 1 times [2025-03-03 15:46:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381673673] [2025-03-03 15:46:18,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:18,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:18,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:18,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:18,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:18,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381673673] [2025-03-03 15:46:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381673673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106147312] [2025-03-03 15:46:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:18,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:18,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:18,267 INFO L87 Difference]: Start difference. First operand 2999 states and 5253 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:18,667 INFO L93 Difference]: Finished difference Result 4660 states and 7750 transitions. [2025-03-03 15:46:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:18,683 INFO L225 Difference]: With dead ends: 4660 [2025-03-03 15:46:18,684 INFO L226 Difference]: Without dead ends: 3794 [2025-03-03 15:46:18,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:18,688 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 4415 mSDsluCounter, 12910 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 17215 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:18,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 17215 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2025-03-03 15:46:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3732. [2025-03-03 15:46:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3534 states have (on average 1.712790039615167) internal successors, (6053), 3556 states have internal predecessors, (6053), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-03 15:46:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 6361 transitions. [2025-03-03 15:46:18,841 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 6361 transitions. Word has length 90 [2025-03-03 15:46:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:18,841 INFO L471 AbstractCegarLoop]: Abstraction has 3732 states and 6361 transitions. [2025-03-03 15:46:18,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 6361 transitions. [2025-03-03 15:46:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:18,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:18,843 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] [2025-03-03 15:46:18,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:46:18,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:18,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash 500965112, now seen corresponding path program 1 times [2025-03-03 15:46:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:18,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118894100] [2025-03-03 15:46:18,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:18,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:18,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:18,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:18,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118894100] [2025-03-03 15:46:19,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118894100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:19,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:19,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355395252] [2025-03-03 15:46:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:19,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:19,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:19,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:19,030 INFO L87 Difference]: Start difference. First operand 3732 states and 6361 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:19,662 INFO L93 Difference]: Finished difference Result 7239 states and 11737 transitions. [2025-03-03 15:46:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:19,685 INFO L225 Difference]: With dead ends: 7239 [2025-03-03 15:46:19,685 INFO L226 Difference]: Without dead ends: 5640 [2025-03-03 15:46:19,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:19,692 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4544 mSDsluCounter, 12890 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 17190 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:19,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 17190 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:46:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2025-03-03 15:46:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 5273. [2025-03-03 15:46:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.655885363357216) internal successors, (8089), 4953 states have internal predecessors, (8089), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-03 15:46:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8781 transitions. [2025-03-03 15:46:19,858 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8781 transitions. Word has length 90 [2025-03-03 15:46:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8781 transitions. [2025-03-03 15:46:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8781 transitions. [2025-03-03 15:46:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:19,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:19,861 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] [2025-03-03 15:46:19,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:46:19,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:19,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1455194007, now seen corresponding path program 1 times [2025-03-03 15:46:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:19,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482866537] [2025-03-03 15:46:19,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:19,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:19,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:19,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:19,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:19,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482866537] [2025-03-03 15:46:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482866537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862716808] [2025-03-03 15:46:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:19,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:19,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:19,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:19,939 INFO L87 Difference]: Start difference. First operand 5273 states and 8781 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:20,230 INFO L93 Difference]: Finished difference Result 8828 states and 14458 transitions. [2025-03-03 15:46:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:20,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:20,259 INFO L225 Difference]: With dead ends: 8828 [2025-03-03 15:46:20,261 INFO L226 Difference]: Without dead ends: 5688 [2025-03-03 15:46:20,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:20,272 INFO L435 NwaCegarLoop]: 4143 mSDtfsCounter, 4307 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 12362 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:20,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 12362 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2025-03-03 15:46:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 5273. [2025-03-03 15:46:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.652405322415558) internal successors, (8072), 4953 states have internal predecessors, (8072), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-03-03 15:46:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8764 transitions. [2025-03-03 15:46:20,432 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8764 transitions. Word has length 90 [2025-03-03 15:46:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:20,432 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8764 transitions. [2025-03-03 15:46:20,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8764 transitions. [2025-03-03 15:46:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:20,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:20,435 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] [2025-03-03 15:46:20,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:46:20,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1208880920, now seen corresponding path program 1 times [2025-03-03 15:46:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484354009] [2025-03-03 15:46:20,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:20,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:20,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:20,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:20,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:20,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484354009] [2025-03-03 15:46:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484354009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:20,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:20,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:20,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464031406] [2025-03-03 15:46:20,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:20,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:20,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:20,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:20,513 INFO L87 Difference]: Start difference. First operand 5273 states and 8764 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:21,056 INFO L93 Difference]: Finished difference Result 12074 states and 19568 transitions. [2025-03-03 15:46:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:21,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:21,091 INFO L225 Difference]: With dead ends: 12074 [2025-03-03 15:46:21,092 INFO L226 Difference]: Without dead ends: 8934 [2025-03-03 15:46:21,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:21,107 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4471 mSDsluCounter, 12867 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4488 SdHoareTripleChecker+Valid, 17159 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:21,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4488 Valid, 17159 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2025-03-03 15:46:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 8493. [2025-03-03 15:46:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5973434040890742) internal successors, (12266), 7893 states have internal predecessors, (12266), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 15:46:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14094 transitions. [2025-03-03 15:46:21,499 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14094 transitions. Word has length 90 [2025-03-03 15:46:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:21,504 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14094 transitions. [2025-03-03 15:46:21,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14094 transitions. [2025-03-03 15:46:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:21,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:21,513 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] [2025-03-03 15:46:21,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:46:21,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:21,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash -461632649, now seen corresponding path program 1 times [2025-03-03 15:46:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:21,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516347932] [2025-03-03 15:46:21,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:21,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:21,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:21,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:21,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516347932] [2025-03-03 15:46:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516347932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:21,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107059237] [2025-03-03 15:46:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:21,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:21,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:21,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:21,672 INFO L87 Difference]: Start difference. First operand 8493 states and 14094 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:22,094 INFO L93 Difference]: Finished difference Result 15588 states and 26038 transitions. [2025-03-03 15:46:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:22,125 INFO L225 Difference]: With dead ends: 15588 [2025-03-03 15:46:22,126 INFO L226 Difference]: Without dead ends: 9228 [2025-03-03 15:46:22,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:22,144 INFO L435 NwaCegarLoop]: 4147 mSDtfsCounter, 4296 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4308 SdHoareTripleChecker+Valid, 12366 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:22,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4308 Valid, 12366 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2025-03-03 15:46:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8493. [2025-03-03 15:46:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5930459695272823) internal successors, (12233), 7893 states have internal predecessors, (12233), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 15:46:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14061 transitions. [2025-03-03 15:46:22,549 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14061 transitions. Word has length 90 [2025-03-03 15:46:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:22,549 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14061 transitions. [2025-03-03 15:46:22,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14061 transitions. [2025-03-03 15:46:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:22,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:22,555 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] [2025-03-03 15:46:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:46:22,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:22,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1069709512, now seen corresponding path program 1 times [2025-03-03 15:46:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337783365] [2025-03-03 15:46:22,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:22,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:22,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:22,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337783365] [2025-03-03 15:46:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337783365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:22,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260491573] [2025-03-03 15:46:22,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:22,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:22,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:22,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:22,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:22,621 INFO L87 Difference]: Start difference. First operand 8493 states and 14061 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:23,194 INFO L93 Difference]: Finished difference Result 15343 states and 25482 transitions. [2025-03-03 15:46:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2025-03-03 15:46:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:23,256 INFO L225 Difference]: With dead ends: 15343 [2025-03-03 15:46:23,259 INFO L226 Difference]: Without dead ends: 8983 [2025-03-03 15:46:23,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:23,304 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4293 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 12358 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:23,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4305 Valid, 12358 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:46:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2025-03-03 15:46:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8493. [2025-03-03 15:46:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5887485349654904) internal successors, (12200), 7893 states have internal predecessors, (12200), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-03-03 15:46:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14028 transitions. [2025-03-03 15:46:23,696 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14028 transitions. Word has length 90 [2025-03-03 15:46:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:23,696 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14028 transitions. [2025-03-03 15:46:23,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14028 transitions. [2025-03-03 15:46:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:46:23,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:23,701 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] [2025-03-03 15:46:23,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:46:23,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:23,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash 711790423, now seen corresponding path program 1 times [2025-03-03 15:46:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528749939] [2025-03-03 15:46:23,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:23,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:46:23,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:46:23,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:23,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:23,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528749939] [2025-03-03 15:46:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528749939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:23,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:23,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:46:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934338848] [2025-03-03 15:46:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:23,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:46:23,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:23,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:46:23,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:46:23,754 INFO L87 Difference]: Start difference. First operand 8493 states and 14028 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:24,231 INFO L93 Difference]: Finished difference Result 21043 states and 34229 transitions. [2025-03-03 15:46:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 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 90 [2025-03-03 15:46:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:24,278 INFO L225 Difference]: With dead ends: 21043 [2025-03-03 15:46:24,278 INFO L226 Difference]: Without dead ends: 14684 [2025-03-03 15:46:24,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:46:24,301 INFO L435 NwaCegarLoop]: 4462 mSDtfsCounter, 4422 mSDsluCounter, 4395 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 8857 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:24,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 8857 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14684 states. [2025-03-03 15:46:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14651. [2025-03-03 15:46:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14651 states, 13029 states have (on average 1.532274157648323) internal successors, (19964), 13488 states have internal predecessors, (19964), 800 states have call successors, (800), 396 states have call predecessors, (800), 820 states have return successors, (2817), 798 states have call predecessors, (2817), 800 states have call successors, (2817) [2025-03-03 15:46:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14651 states to 14651 states and 23581 transitions. [2025-03-03 15:46:25,158 INFO L78 Accepts]: Start accepts. Automaton has 14651 states and 23581 transitions. Word has length 90 [2025-03-03 15:46:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 14651 states and 23581 transitions. [2025-03-03 15:46:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 14651 states and 23581 transitions. [2025-03-03 15:46:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:46:25,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:25,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:25,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:46:25,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1908313067, now seen corresponding path program 1 times [2025-03-03 15:46:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754342573] [2025-03-03 15:46:25,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:25,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:25,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:25,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:25,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754342573] [2025-03-03 15:46:25,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754342573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181251143] [2025-03-03 15:46:25,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:25,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:25,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:25,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:25,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:46:25,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:25,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:25,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:25,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:25,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:25,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:46:25,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181251143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:25,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:25,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:25,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247331564] [2025-03-03 15:46:25,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:25,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:25,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:25,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:25,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:25,431 INFO L87 Difference]: Start difference. First operand 14651 states and 23581 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:26,478 INFO L93 Difference]: Finished difference Result 39354 states and 62625 transitions. [2025-03-03 15:46:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:26,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:46:26,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:26,587 INFO L225 Difference]: With dead ends: 39354 [2025-03-03 15:46:26,587 INFO L226 Difference]: Without dead ends: 26837 [2025-03-03 15:46:26,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:26,626 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4179 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4179 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:26,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4179 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26837 states. [2025-03-03 15:46:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26837 to 26637. [2025-03-03 15:46:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26637 states, 23465 states have (on average 1.5041125079906243) internal successors, (35294), 24381 states have internal predecessors, (35294), 1530 states have call successors, (1530), 792 states have call predecessors, (1530), 1640 states have return successors, (5533), 1495 states have call predecessors, (5533), 1530 states have call successors, (5533) [2025-03-03 15:46:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26637 states to 26637 states and 42357 transitions. [2025-03-03 15:46:27,841 INFO L78 Accepts]: Start accepts. Automaton has 26637 states and 42357 transitions. Word has length 148 [2025-03-03 15:46:27,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:27,841 INFO L471 AbstractCegarLoop]: Abstraction has 26637 states and 42357 transitions. [2025-03-03 15:46:27,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 26637 states and 42357 transitions. [2025-03-03 15:46:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:46:27,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:27,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:27,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:46:28,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 15:46:28,082 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -905321189, now seen corresponding path program 1 times [2025-03-03 15:46:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964504196] [2025-03-03 15:46:28,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:28,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:28,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:28,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:28,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:28,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964504196] [2025-03-03 15:46:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964504196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987969757] [2025-03-03 15:46:28,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:28,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:28,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:28,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:28,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:46:28,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:28,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:28,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:28,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:28,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:28,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:46:28,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987969757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:28,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:28,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:28,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100736800] [2025-03-03 15:46:28,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:28,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:28,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:28,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:28,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:28,318 INFO L87 Difference]: Start difference. First operand 26637 states and 42357 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:30,312 INFO L93 Difference]: Finished difference Result 74982 states and 118759 transitions. [2025-03-03 15:46:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:30,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:46:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:30,506 INFO L225 Difference]: With dead ends: 74982 [2025-03-03 15:46:30,506 INFO L226 Difference]: Without dead ends: 50479 [2025-03-03 15:46:30,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:30,579 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4173 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:30,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:30,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50479 states. [2025-03-03 15:46:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50479 to 50081. [2025-03-03 15:46:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50081 states, 43875 states have (on average 1.488182336182336) internal successors, (65294), 45705 states have internal predecessors, (65294), 2924 states have call successors, (2924), 1584 states have call predecessors, (2924), 3280 states have return successors, (10899), 2823 states have call predecessors, (10899), 2924 states have call successors, (10899) [2025-03-03 15:46:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50081 states to 50081 states and 79117 transitions. [2025-03-03 15:46:33,116 INFO L78 Accepts]: Start accepts. Automaton has 50081 states and 79117 transitions. Word has length 148 [2025-03-03 15:46:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:33,118 INFO L471 AbstractCegarLoop]: Abstraction has 50081 states and 79117 transitions. [2025-03-03 15:46:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 50081 states and 79117 transitions. [2025-03-03 15:46:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:46:33,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:33,170 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:33,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:46:33,375 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,SelfDestructingSolverStorable12 [2025-03-03 15:46:33,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:33,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash -584772959, now seen corresponding path program 1 times [2025-03-03 15:46:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731882274] [2025-03-03 15:46:33,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:33,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:33,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:33,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:33,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:33,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731882274] [2025-03-03 15:46:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731882274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356590322] [2025-03-03 15:46:33,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:33,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:33,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:33,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:33,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:46:33,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:33,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:33,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:33,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:33,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:33,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:46:33,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356590322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:33,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:33,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:33,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896915647] [2025-03-03 15:46:33,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:33,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:33,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:33,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:33,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:33,601 INFO L87 Difference]: Start difference. First operand 50081 states and 79117 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:37,482 INFO L93 Difference]: Finished difference Result 145038 states and 229225 transitions. [2025-03-03 15:46:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:46:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:38,016 INFO L225 Difference]: With dead ends: 145038 [2025-03-03 15:46:38,017 INFO L226 Difference]: Without dead ends: 97091 [2025-03-03 15:46:38,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:38,111 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4185 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:38,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4185 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97091 states. [2025-03-03 15:46:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97091 to 96297. [2025-03-03 15:46:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96297 states, 84027 states have (on average 1.4784533542789817) internal successors, (124230), 87685 states have internal predecessors, (124230), 5708 states have call successors, (5708), 3168 states have call predecessors, (5708), 6560 states have return successors, (21627), 5475 states have call predecessors, (21627), 5708 states have call successors, (21627) [2025-03-03 15:46:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96297 states to 96297 states and 151565 transitions. [2025-03-03 15:46:43,165 INFO L78 Accepts]: Start accepts. Automaton has 96297 states and 151565 transitions. Word has length 148 [2025-03-03 15:46:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:43,165 INFO L471 AbstractCegarLoop]: Abstraction has 96297 states and 151565 transitions. [2025-03-03 15:46:43,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 96297 states and 151565 transitions. [2025-03-03 15:46:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:46:43,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:43,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:43,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:46:43,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:43,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:43,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash 8005415, now seen corresponding path program 1 times [2025-03-03 15:46:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057388329] [2025-03-03 15:46:43,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:43,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:43,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:43,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:43,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057388329] [2025-03-03 15:46:43,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057388329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:43,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141067924] [2025-03-03 15:46:43,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:43,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:43,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:43,500 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:43,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:46:43,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:46:43,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:46:43,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:43,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:43,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:46:43,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:43,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141067924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825378754] [2025-03-03 15:46:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:43,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:43,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:43,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:43,671 INFO L87 Difference]: Start difference. First operand 96297 states and 151565 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:49,858 INFO L93 Difference]: Finished difference Result 282750 states and 446297 transitions. [2025-03-03 15:46:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:49,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-03-03 15:46:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:50,478 INFO L225 Difference]: With dead ends: 282750 [2025-03-03 15:46:50,479 INFO L226 Difference]: Without dead ends: 188587 [2025-03-03 15:46:50,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:50,684 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4167 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:50,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188587 states.