./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.05.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_label44+token_ring.05.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 806c9058928482f755246f30ce94bbbe3c870162d7ccdd45454f74a5441d158a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:41:33,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:41:33,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:41:33,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:41:33,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:41:33,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:41:33,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:41:33,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:41:33,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:41:33,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:41:33,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:41:33,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:41:33,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:41:33,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:41:33,563 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:41:33,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:41:33,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:41:33,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:41:33,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:41:33,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:41:33,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:41:33,565 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 -> 806c9058928482f755246f30ce94bbbe3c870162d7ccdd45454f74a5441d158a [2025-03-03 15:41:33,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:41:33,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:41:33,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:41:33,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:41:33,841 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:41:33,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.05.cil-1.c [2025-03-03 15:41:34,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edb20106/b4831b6f018f4a9289afcff5ec38323e/FLAGb4e01267f [2025-03-03 15:41:35,431 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:41:35,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.05.cil-1.c [2025-03-03 15:41:35,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edb20106/b4831b6f018f4a9289afcff5ec38323e/FLAGb4e01267f [2025-03-03 15:41:35,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edb20106/b4831b6f018f4a9289afcff5ec38323e [2025-03-03 15:41:35,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:41:35,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:41:35,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:41:35,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:41:35,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:41:35,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:41:35" (1/1) ... [2025-03-03 15:41:35,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e5f039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:35, skipping insertion in model container [2025-03-03 15:41:35,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:41:35" (1/1) ... [2025-03-03 15:41:35,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:41:36,726 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_label44+token_ring.05.cil-1.c[377340,377353] [2025-03-03 15:41:36,754 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_label44+token_ring.05.cil-1.c[383339,383352] [2025-03-03 15:41:36,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:41:36,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:41:37,486 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_label44+token_ring.05.cil-1.c[377340,377353] [2025-03-03 15:41:37,493 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_label44+token_ring.05.cil-1.c[383339,383352] [2025-03-03 15:41:37,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:41:37,549 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:41:37,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37 WrapperNode [2025-03-03 15:41:37,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:41:37,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:41:37,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:41:37,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:41:37,557 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:41:37" (1/1) ... [2025-03-03 15:41:37,638 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:41:37" (1/1) ... [2025-03-03 15:41:38,010 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-03-03 15:41:38,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:41:38,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:41:38,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:41:38,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:41:38,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,179 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:41:38,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:41:38,450 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:41:38,450 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:41:38,450 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:41:38,451 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (1/1) ... [2025-03-03 15:41:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:41:38,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:41:38,479 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:41:38,485 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:41:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:41:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:41:38,502 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:41:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:41:38,503 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:41:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:41:38,503 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:41:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:41:38,503 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:41:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:41:38,503 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:41:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:41:38,503 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:41:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:41:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:41:38,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:41:38,624 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:41:38,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:41:44,632 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:41:44,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:41:44,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:41:44,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:41:44,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:41:44,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:41:44,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:41:44,852 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-03-03 15:41:44,853 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:41:44,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:41:44,897 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:41:44,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:41:44 BoogieIcfgContainer [2025-03-03 15:41:44,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:41:44,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:41:44,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:41:44,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:41:44,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:41:35" (1/3) ... [2025-03-03 15:41:44,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645109d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:41:44, skipping insertion in model container [2025-03-03 15:41:44,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:41:37" (2/3) ... [2025-03-03 15:41:44,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645109d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:41:44, skipping insertion in model container [2025-03-03 15:41:44,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:41:44" (3/3) ... [2025-03-03 15:41:44,911 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.05.cil-1.c [2025-03-03 15:41:44,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:41:44,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.05.cil-1.c that has 7 procedures, 2402 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 15:41:45,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:41:45,040 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;@b9f347e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:41:45,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:41:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 15:41:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:45,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:45,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:45,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1126425006, now seen corresponding path program 1 times [2025-03-03 15:41:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:45,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412441226] [2025-03-03 15:41:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:45,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:45,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:45,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:45,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:45,469 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:41:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412441226] [2025-03-03 15:41:45,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412441226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:45,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291511861] [2025-03-03 15:41:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:45,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:45,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:45,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:45,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:45,502 INFO L87 Difference]: Start difference. First operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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:41:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:45,976 INFO L93 Difference]: Finished difference Result 5015 states and 9165 transitions. [2025-03-03 15:41:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:41:45,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:46,002 INFO L225 Difference]: With dead ends: 5015 [2025-03-03 15:41:46,003 INFO L226 Difference]: Without dead ends: 2556 [2025-03-03 15:41:46,011 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:41:46,012 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4593 mSDsluCounter, 8689 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 12967 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:46,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 12967 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:41:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-03-03 15:41:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2541. [2025-03-03 15:41:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8134777376654634) internal successors, (4521), 2496 states have internal predecessors, (4521), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:41:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4588 transitions. [2025-03-03 15:41:46,138 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4588 transitions. Word has length 101 [2025-03-03 15:41:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:46,138 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4588 transitions. [2025-03-03 15:41:46,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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:41:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4588 transitions. [2025-03-03 15:41:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:46,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:46,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:41:46,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 267982704, now seen corresponding path program 1 times [2025-03-03 15:41:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895505976] [2025-03-03 15:41:46,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:46,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:46,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:46,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:46,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:46,288 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:41:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:46,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895505976] [2025-03-03 15:41:46,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895505976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:46,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:46,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:46,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848204592] [2025-03-03 15:41:46,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:46,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:46,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:46,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:46,293 INFO L87 Difference]: Start difference. First operand 2541 states and 4588 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:46,546 INFO L93 Difference]: Finished difference Result 2984 states and 5267 transitions. [2025-03-03 15:41:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:46,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:46,556 INFO L225 Difference]: With dead ends: 2984 [2025-03-03 15:41:46,557 INFO L226 Difference]: Without dead ends: 2577 [2025-03-03 15:41:46,559 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:41:46,560 INFO L435 NwaCegarLoop]: 4197 mSDtfsCounter, 4370 mSDsluCounter, 8309 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4383 SdHoareTripleChecker+Valid, 12506 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:46,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4383 Valid, 12506 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-03-03 15:41:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2541. [2025-03-03 15:41:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8126754913758525) internal successors, (4519), 2496 states have internal predecessors, (4519), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:41:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4586 transitions. [2025-03-03 15:41:46,679 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4586 transitions. Word has length 101 [2025-03-03 15:41:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:46,679 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4586 transitions. [2025-03-03 15:41:46,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4586 transitions. [2025-03-03 15:41:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:46,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:46,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:46,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:41:46,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:46,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:46,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1475900879, now seen corresponding path program 1 times [2025-03-03 15:41:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939210921] [2025-03-03 15:41:46,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:46,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:46,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:46,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:46,853 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:41:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939210921] [2025-03-03 15:41:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939210921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:46,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:46,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80094705] [2025-03-03 15:41:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:46,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:46,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:46,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:46,856 INFO L87 Difference]: Start difference. First operand 2541 states and 4586 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:47,315 INFO L93 Difference]: Finished difference Result 3199 states and 5583 transitions. [2025-03-03 15:41:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:47,325 INFO L225 Difference]: With dead ends: 3199 [2025-03-03 15:41:47,326 INFO L226 Difference]: Without dead ends: 2792 [2025-03-03 15:41:47,328 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:41:47,328 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 4514 mSDsluCounter, 13119 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4527 SdHoareTripleChecker+Valid, 17490 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:47,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4527 Valid, 17490 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:41:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2025-03-03 15:41:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2733. [2025-03-03 15:41:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2733 states, 2664 states have (on average 1.7909159159159158) internal successors, (4771), 2668 states have internal predecessors, (4771), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-03 15:41:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 4869 transitions. [2025-03-03 15:41:47,390 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 4869 transitions. Word has length 101 [2025-03-03 15:41:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:47,390 INFO L471 AbstractCegarLoop]: Abstraction has 2733 states and 4869 transitions. [2025-03-03 15:41:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 4869 transitions. [2025-03-03 15:41:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:47,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:47,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:41:47,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -9154672, now seen corresponding path program 1 times [2025-03-03 15:41:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:47,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048536339] [2025-03-03 15:41:47,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:47,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:47,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:47,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:47,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:41:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048536339] [2025-03-03 15:41:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048536339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121268753] [2025-03-03 15:41:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:47,512 INFO L87 Difference]: Start difference. First operand 2733 states and 4869 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:47,948 INFO L93 Difference]: Finished difference Result 3800 states and 6481 transitions. [2025-03-03 15:41:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:47,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:47,962 INFO L225 Difference]: With dead ends: 3800 [2025-03-03 15:41:47,963 INFO L226 Difference]: Without dead ends: 3201 [2025-03-03 15:41:47,966 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:41:47,968 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4509 mSDsluCounter, 13107 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 17474 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:47,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 17474 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:41:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-03-03 15:41:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3136. [2025-03-03 15:41:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3023 states have (on average 1.7552100562355277) internal successors, (5306), 3031 states have internal predecessors, (5306), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-03 15:41:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 5472 transitions. [2025-03-03 15:41:48,135 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 5472 transitions. Word has length 101 [2025-03-03 15:41:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:48,136 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 5472 transitions. [2025-03-03 15:41:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 5472 transitions. [2025-03-03 15:41:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:48,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:48,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:41:48,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:48,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 774224303, now seen corresponding path program 1 times [2025-03-03 15:41:48,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:48,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961718155] [2025-03-03 15:41:48,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:48,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:48,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:48,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:48,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:48,366 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:41:48,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:48,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961718155] [2025-03-03 15:41:48,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961718155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:48,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:48,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810318273] [2025-03-03 15:41:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:48,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:48,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:48,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:48,368 INFO L87 Difference]: Start difference. First operand 3136 states and 5472 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:48,887 INFO L93 Difference]: Finished difference Result 5073 states and 8422 transitions. [2025-03-03 15:41:48,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:48,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:48,904 INFO L225 Difference]: With dead ends: 5073 [2025-03-03 15:41:48,904 INFO L226 Difference]: Without dead ends: 4071 [2025-03-03 15:41:48,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:48,911 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4504 mSDsluCounter, 13098 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 17462 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:48,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 17462 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:41:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2025-03-03 15:41:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3993. [2025-03-03 15:41:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3786 states have (on average 1.705758055995774) internal successors, (6458), 3808 states have internal predecessors, (6458), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-03 15:41:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 6784 transitions. [2025-03-03 15:41:49,035 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 6784 transitions. Word has length 101 [2025-03-03 15:41:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:49,036 INFO L471 AbstractCegarLoop]: Abstraction has 3993 states and 6784 transitions. [2025-03-03 15:41:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 6784 transitions. [2025-03-03 15:41:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:49,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:49,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:49,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:41:49,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:49,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash 245305264, now seen corresponding path program 1 times [2025-03-03 15:41:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:49,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874889063] [2025-03-03 15:41:49,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:49,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:49,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:49,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:49,135 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:41:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874889063] [2025-03-03 15:41:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874889063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:49,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:49,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678588664] [2025-03-03 15:41:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:49,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:49,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:49,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:49,137 INFO L87 Difference]: Start difference. First operand 3993 states and 6784 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:49,671 INFO L93 Difference]: Finished difference Result 8086 states and 13121 transitions. [2025-03-03 15:41:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:49,695 INFO L225 Difference]: With dead ends: 8086 [2025-03-03 15:41:49,695 INFO L226 Difference]: Without dead ends: 6227 [2025-03-03 15:41:49,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:41:49,703 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4660 mSDsluCounter, 13068 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4679 SdHoareTripleChecker+Valid, 17423 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:49,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4679 Valid, 17423 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:41:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2025-03-03 15:41:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 5791. [2025-03-03 15:41:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6531748978834013) internal successors, (8904), 5454 states have internal predecessors, (8904), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:41:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9630 transitions. [2025-03-03 15:41:49,888 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9630 transitions. Word has length 101 [2025-03-03 15:41:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:49,888 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9630 transitions. [2025-03-03 15:41:49,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9630 transitions. [2025-03-03 15:41:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:49,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:49,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:41:49,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 365425137, now seen corresponding path program 1 times [2025-03-03 15:41:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:49,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55181962] [2025-03-03 15:41:49,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:49,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:49,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:49,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:49,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:49,975 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:41:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55181962] [2025-03-03 15:41:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55181962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415074797] [2025-03-03 15:41:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:49,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:49,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:49,977 INFO L87 Difference]: Start difference. First operand 5791 states and 9630 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:50,325 INFO L93 Difference]: Finished difference Result 9946 states and 16320 transitions. [2025-03-03 15:41:50,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:50,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:50,360 INFO L225 Difference]: With dead ends: 9946 [2025-03-03 15:41:50,360 INFO L226 Difference]: Without dead ends: 6289 [2025-03-03 15:41:50,370 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:41:50,370 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4360 mSDsluCounter, 8282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4373 SdHoareTripleChecker+Valid, 12466 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:50,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4373 Valid, 12466 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2025-03-03 15:41:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5791. [2025-03-03 15:41:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6500185666542888) internal successors, (8887), 5454 states have internal predecessors, (8887), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:41:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9613 transitions. [2025-03-03 15:41:50,555 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9613 transitions. Word has length 101 [2025-03-03 15:41:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:50,556 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9613 transitions. [2025-03-03 15:41:50,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9613 transitions. [2025-03-03 15:41:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:50,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:50,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:50,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:41:50,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:50,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash 784941968, now seen corresponding path program 1 times [2025-03-03 15:41:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:50,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264762871] [2025-03-03 15:41:50,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:50,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:50,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:50,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:50,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:50,670 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:41:50,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264762871] [2025-03-03 15:41:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264762871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276191850] [2025-03-03 15:41:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:50,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:50,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:50,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:50,672 INFO L87 Difference]: Start difference. First operand 5791 states and 9613 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:51,589 INFO L93 Difference]: Finished difference Result 13810 states and 22442 transitions. [2025-03-03 15:41:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:51,627 INFO L225 Difference]: With dead ends: 13810 [2025-03-03 15:41:51,627 INFO L226 Difference]: Without dead ends: 10153 [2025-03-03 15:41:51,642 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:41:51,642 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4587 mSDsluCounter, 13045 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 17392 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:51,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 17392 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:41:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2025-03-03 15:41:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 9579. [2025-03-03 15:41:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6043289051763627) internal successors, (14009), 8946 states have internal predecessors, (14009), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:41:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15903 transitions. [2025-03-03 15:41:51,976 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15903 transitions. Word has length 101 [2025-03-03 15:41:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:51,977 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15903 transitions. [2025-03-03 15:41:51,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15903 transitions. [2025-03-03 15:41:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:51,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:51,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:51,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:41:51,984 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:51,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash 798474769, now seen corresponding path program 1 times [2025-03-03 15:41:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277274269] [2025-03-03 15:41:51,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:51,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:51,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:51,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:51,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:52,048 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:41:52,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277274269] [2025-03-03 15:41:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277274269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393533464] [2025-03-03 15:41:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:52,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:52,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:52,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:52,049 INFO L87 Difference]: Start difference. First operand 9579 states and 15903 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:52,557 INFO L93 Difference]: Finished difference Result 18004 states and 30144 transitions. [2025-03-03 15:41:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:52,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:52,594 INFO L225 Difference]: With dead ends: 18004 [2025-03-03 15:41:52,595 INFO L226 Difference]: Without dead ends: 10559 [2025-03-03 15:41:52,617 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:41:52,618 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4356 mSDsluCounter, 8273 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12452 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:52,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12452 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-03-03 15:41:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 9579. [2025-03-03 15:41:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6005497022446176) internal successors, (13976), 8946 states have internal predecessors, (13976), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:41:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15870 transitions. [2025-03-03 15:41:53,235 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15870 transitions. Word has length 101 [2025-03-03 15:41:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:53,235 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15870 transitions. [2025-03-03 15:41:53,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15870 transitions. [2025-03-03 15:41:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:53,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:53,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:41:53,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:53,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1907289968, now seen corresponding path program 1 times [2025-03-03 15:41:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:53,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718313773] [2025-03-03 15:41:53,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:53,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:53,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:53,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:53,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:53,314 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:41:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:53,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718313773] [2025-03-03 15:41:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718313773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:53,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:53,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:41:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513060408] [2025-03-03 15:41:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:53,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:41:53,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:53,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:41:53,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:41:53,316 INFO L87 Difference]: Start difference. First operand 9579 states and 15870 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:53,804 INFO L93 Difference]: Finished difference Result 17759 states and 29588 transitions. [2025-03-03 15:41:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:53,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:53,837 INFO L225 Difference]: With dead ends: 17759 [2025-03-03 15:41:53,838 INFO L226 Difference]: Without dead ends: 10314 [2025-03-03 15:41:53,852 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:41:53,853 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4353 mSDsluCounter, 8268 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4366 SdHoareTripleChecker+Valid, 12444 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:53,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4366 Valid, 12444 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:41:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10314 states. [2025-03-03 15:41:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10314 to 9579. [2025-03-03 15:41:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.5967704993128722) internal successors, (13943), 8946 states have internal predecessors, (13943), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:41:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15837 transitions. [2025-03-03 15:41:54,676 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15837 transitions. Word has length 101 [2025-03-03 15:41:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:54,676 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15837 transitions. [2025-03-03 15:41:54,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:41:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15837 transitions. [2025-03-03 15:41:54,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:54,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:54,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:41:54,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:54,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1520625103, now seen corresponding path program 1 times [2025-03-03 15:41:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14034246] [2025-03-03 15:41:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:54,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:54,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:54,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:54,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:54,831 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:41:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14034246] [2025-03-03 15:41:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14034246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:54,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:54,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:41:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95322960] [2025-03-03 15:41:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:54,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:41:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:54,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:41:54,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:41:54,832 INFO L87 Difference]: Start difference. First operand 9579 states and 15837 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:55,699 INFO L93 Difference]: Finished difference Result 24974 states and 41916 transitions. [2025-03-03 15:41:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:41:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:55,756 INFO L225 Difference]: With dead ends: 24974 [2025-03-03 15:41:55,757 INFO L226 Difference]: Without dead ends: 17529 [2025-03-03 15:41:55,772 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:41:55,773 INFO L435 NwaCegarLoop]: 4334 mSDtfsCounter, 4476 mSDsluCounter, 13008 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 17342 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:55,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 17342 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:41:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2025-03-03 15:41:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 17188. [2025-03-03 15:41:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17188 states, 15311 states have (on average 1.5512376722617727) internal successors, (23751), 15979 states have internal predecessors, (23751), 819 states have call successors, (819), 390 states have call predecessors, (819), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-03 15:41:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 29485 transitions. [2025-03-03 15:41:56,760 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 29485 transitions. Word has length 101 [2025-03-03 15:41:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:56,761 INFO L471 AbstractCegarLoop]: Abstraction has 17188 states and 29485 transitions. [2025-03-03 15:41:56,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:41:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 29485 transitions. [2025-03-03 15:41:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:41:56,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:41:56,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:41:56,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:41:56,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:41:56,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:41:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1077013680, now seen corresponding path program 1 times [2025-03-03 15:41:56,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:41:56,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787480568] [2025-03-03 15:41:56,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:41:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:41:56,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:41:56,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:41:56,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:41:56,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:41:56,827 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:41:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:41:56,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787480568] [2025-03-03 15:41:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787480568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:41:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:41:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:41:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167193925] [2025-03-03 15:41:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:41:56,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:41:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:41:56,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:41:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:41:56,829 INFO L87 Difference]: Start difference. First operand 17188 states and 29485 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:41:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:41:58,235 INFO L93 Difference]: Finished difference Result 46966 states and 80758 transitions. [2025-03-03 15:41:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:41:58,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2025-03-03 15:41:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:41:58,344 INFO L225 Difference]: With dead ends: 46966 [2025-03-03 15:41:58,344 INFO L226 Difference]: Without dead ends: 31913 [2025-03-03 15:41:58,449 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:41:58,450 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 4499 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 9021 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:41:58,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 9021 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:41:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31913 states. [2025-03-03 15:41:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31913 to 31848. [2025-03-03 15:41:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31848 states, 28100 states have (on average 1.5165836298932385) internal successors, (42616), 29499 states have internal predecessors, (42616), 1634 states have call successors, (1634), 780 states have call predecessors, (1634), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-03 15:41:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31848 states to 31848 states and 54013 transitions. [2025-03-03 15:41:59,887 INFO L78 Accepts]: Start accepts. Automaton has 31848 states and 54013 transitions. Word has length 101 [2025-03-03 15:41:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:41:59,888 INFO L471 AbstractCegarLoop]: Abstraction has 31848 states and 54013 transitions. [2025-03-03 15:41:59,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:41:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 31848 states and 54013 transitions. [2025-03-03 15:42:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:42:00,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:00,028 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:00,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:42:00,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:00,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash -638692433, now seen corresponding path program 1 times [2025-03-03 15:42:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:00,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063417300] [2025-03-03 15:42:00,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:00,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:00,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:00,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:00,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:00,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063417300] [2025-03-03 15:42:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063417300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521312414] [2025-03-03 15:42:00,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:00,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:00,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:00,108 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:42:00,110 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:42:00,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:00,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:00,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:00,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:42:00,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:00,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521312414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:00,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:00,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594591079] [2025-03-03 15:42:00,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:00,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:00,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:00,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:00,304 INFO L87 Difference]: Start difference. First operand 31848 states and 54013 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:42:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:02,729 INFO L93 Difference]: Finished difference Result 90623 states and 153823 transitions. [2025-03-03 15:42:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:02,730 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 166 [2025-03-03 15:42:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:02,965 INFO L225 Difference]: With dead ends: 90623 [2025-03-03 15:42:02,966 INFO L226 Difference]: Without dead ends: 60910 [2025-03-03 15:42:03,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 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:42:03,033 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4219 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 4552 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:42:03,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4219 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60910 states. [2025-03-03 15:42:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60910 to 60518. [2025-03-03 15:42:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60518 states, 53158 states have (on average 1.5041197938221904) internal successors, (79956), 55954 states have internal predecessors, (79956), 3134 states have call successors, (3134), 1560 states have call predecessors, (3134), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-03 15:42:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 102419 transitions. [2025-03-03 15:42:06,415 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 102419 transitions. Word has length 166 [2025-03-03 15:42:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:06,416 INFO L471 AbstractCegarLoop]: Abstraction has 60518 states and 102419 transitions. [2025-03-03 15:42:06,416 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-03-03 15:42:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 102419 transitions. [2025-03-03 15:42:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:42:06,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:06,487 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:06,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:42:06,688 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,SelfDestructingSolverStorable12 [2025-03-03 15:42:06,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash -229481751, now seen corresponding path program 1 times [2025-03-03 15:42:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512124396] [2025-03-03 15:42:06,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:06,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:06,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:06,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:06,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512124396] [2025-03-03 15:42:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512124396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486287341] [2025-03-03 15:42:06,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:06,762 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:42:06,764 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:42:06,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:06,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:06,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:06,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:06,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:06,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:42:06,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486287341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:06,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161490695] [2025-03-03 15:42:06,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:06,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:06,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:06,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:06,947 INFO L87 Difference]: Start difference. First operand 60518 states and 102419 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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:42:11,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:11,574 INFO L93 Difference]: Finished difference Result 175983 states and 298721 transitions. [2025-03-03 15:42:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 166 [2025-03-03 15:42:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:12,047 INFO L225 Difference]: With dead ends: 175983 [2025-03-03 15:42:12,047 INFO L226 Difference]: Without dead ends: 117600 [2025-03-03 15:42:12,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 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:42:12,217 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4213 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 4552 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:42:12,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4213 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:12,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117600 states. [2025-03-03 15:42:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117600 to 116818. [2025-03-03 15:42:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116818 states, 102364 states have (on average 1.497948497518659) internal successors, (153336), 107954 states have internal predecessors, (153336), 6004 states have call successors, (6004), 3120 states have call predecessors, (6004), 8448 states have return successors, (38331), 5807 states have call predecessors, (38331), 6004 states have call successors, (38331) [2025-03-03 15:42:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116818 states to 116818 states and 197671 transitions. [2025-03-03 15:42:18,641 INFO L78 Accepts]: Start accepts. Automaton has 116818 states and 197671 transitions. Word has length 166 [2025-03-03 15:42:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:18,642 INFO L471 AbstractCegarLoop]: Abstraction has 116818 states and 197671 transitions. [2025-03-03 15:42:18,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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:42:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 116818 states and 197671 transitions. [2025-03-03 15:42:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:42:18,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:18,773 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, 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, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:18,780 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:42:18,973 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,SelfDestructingSolverStorable13 [2025-03-03 15:42:18,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash -304552541, now seen corresponding path program 1 times [2025-03-03 15:42:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668050975] [2025-03-03 15:42:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:18,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:18,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668050975] [2025-03-03 15:42:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668050975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:19,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822853243] [2025-03-03 15:42:19,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:19,061 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:42:19,063 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:42:19,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:19,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:19,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:19,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:19,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:19,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:42:19,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822853243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:19,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:19,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:19,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035320689] [2025-03-03 15:42:19,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:19,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:19,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:19,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:19,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:19,271 INFO L87 Difference]: Start difference. First operand 116818 states and 197671 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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:42:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:26,957 INFO L93 Difference]: Finished difference Result 344351 states and 584987 transitions. [2025-03-03 15:42:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 166 [2025-03-03 15:42:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:28,145 INFO L225 Difference]: With dead ends: 344351 [2025-03-03 15:42:28,145 INFO L226 Difference]: Without dead ends: 229668 [2025-03-03 15:42:28,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 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:42:28,426 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4201 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4201 SdHoareTripleChecker+Valid, 4552 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:42:28,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4201 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229668 states.