./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.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_label45+token_ring.02.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 1e48f4337a15a9c341fdd857d44943beb3f49e54e3888dcfe82472f36a11730d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:42:19,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:42:19,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:42:19,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:42:19,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:42:19,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:42:19,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:42:19,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:42:19,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:42:19,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:42:19,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:42:19,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:42:19,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:42:19,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:42:19,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:42:19,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:42:19,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:42:19,762 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 -> 1e48f4337a15a9c341fdd857d44943beb3f49e54e3888dcfe82472f36a11730d [2025-03-03 15:42:19,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:42:19,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:42:19,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:42:19,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:42:19,970 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:42:19,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-1.c [2025-03-03 15:42:21,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd045c418/bab0af9c62bd4a74998166018f20587d/FLAG4c8a18aa7 [2025-03-03 15:42:21,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:42:21,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.02.cil-1.c [2025-03-03 15:42:21,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd045c418/bab0af9c62bd4a74998166018f20587d/FLAG4c8a18aa7 [2025-03-03 15:42:21,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd045c418/bab0af9c62bd4a74998166018f20587d [2025-03-03 15:42:21,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:42:21,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:42:21,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:42:21,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:42:21,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:42:21,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:42:21" (1/1) ... [2025-03-03 15:42:21,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164ad910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:21, skipping insertion in model container [2025-03-03 15:42:21,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:42:21" (1/1) ... [2025-03-03 15:42:21,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:42:22,932 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_label45+token_ring.02.cil-1.c[380323,380336] [2025-03-03 15:42:22,962 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_label45+token_ring.02.cil-1.c[383339,383352] [2025-03-03 15:42:23,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:42:23,097 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:42:23,576 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_label45+token_ring.02.cil-1.c[380323,380336] [2025-03-03 15:42:23,581 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_label45+token_ring.02.cil-1.c[383339,383352] [2025-03-03 15:42:23,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:42:23,639 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:42:23,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23 WrapperNode [2025-03-03 15:42:23,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:42:23,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:42:23,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:42:23,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:42:23,649 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:42:23" (1/1) ... [2025-03-03 15:42:23,720 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:42:23" (1/1) ... [2025-03-03 15:42:24,018 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12615 [2025-03-03 15:42:24,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:42:24,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:42:24,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:42:24,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:42:24,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,195 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:42:24,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,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:42:23" (1/1) ... [2025-03-03 15:42:24,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:42:24,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:42:24,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:42:24,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:42:24,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (1/1) ... [2025-03-03 15:42:24,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:42:24,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:24,485 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:42:24,488 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:42:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:42:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:42:24,507 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:42:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:42:24,507 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:42:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:42:24,508 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:42:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:42:24,508 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:42:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:42:24,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:42:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:42:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:42:24,509 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:42:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:42:24,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:42:24,591 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:42:24,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:42:30,513 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:42:30,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:42:30,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:42:30,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:42:30,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:42:30,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:42:30,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:42:30,746 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2025-03-03 15:42:30,747 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:42:30,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:42:30,789 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:42:30,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:42:30 BoogieIcfgContainer [2025-03-03 15:42:30,789 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:42:30,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:42:30,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:42:30,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:42:30,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:42:21" (1/3) ... [2025-03-03 15:42:30,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7bb667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:42:30, skipping insertion in model container [2025-03-03 15:42:30,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:23" (2/3) ... [2025-03-03 15:42:30,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7bb667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:42:30, skipping insertion in model container [2025-03-03 15:42:30,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:42:30" (3/3) ... [2025-03-03 15:42:30,796 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.02.cil-1.c [2025-03-03 15:42:30,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:42:30,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.02.cil-1.c that has 7 procedures, 2321 locations, 1 initial locations, 6 loop locations, and 2 error locations. [2025-03-03 15:42:30,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:42:30,882 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;@23ea0bca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:42:30,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:42:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 2321 states, 2296 states have (on average 1.8523519163763067) internal successors, (4253), 2299 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 15:42:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:42:30,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:30,895 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] [2025-03-03 15:42:30,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:30,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1137518292, now seen corresponding path program 1 times [2025-03-03 15:42:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631641770] [2025-03-03 15:42:30,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:30,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:42:30,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:42:30,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:30,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:31,213 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:42:31,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:31,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631641770] [2025-03-03 15:42:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631641770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:31,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589311146] [2025-03-03 15:42:31,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:31,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:31,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:31,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:31,249 INFO L87 Difference]: Start difference. First operand has 2321 states, 2296 states have (on average 1.8523519163763067) internal successors, (4253), 2299 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:42:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:31,617 INFO L93 Difference]: Finished difference Result 4636 states and 8565 transitions. [2025-03-03 15:42:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:31,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:42:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:31,636 INFO L225 Difference]: With dead ends: 4636 [2025-03-03 15:42:31,636 INFO L226 Difference]: Without dead ends: 2260 [2025-03-03 15:42:31,645 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:42:31,647 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4254 mSDsluCounter, 8269 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4264 SdHoareTripleChecker+Valid, 12431 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:31,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4264 Valid, 12431 Invalid, 187 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2025-03-03 15:42:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2254. [2025-03-03 15:42:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2230 states have (on average 1.8457399103139014) internal successors, (4116), 2232 states have internal predecessors, (4116), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 15:42:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 4148 transitions. [2025-03-03 15:42:31,751 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 4148 transitions. Word has length 68 [2025-03-03 15:42:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:31,752 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 4148 transitions. [2025-03-03 15:42:31,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:42:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 4148 transitions. [2025-03-03 15:42:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:42:31,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:31,755 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] [2025-03-03 15:42:31,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:42:31,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:31,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash -699508789, now seen corresponding path program 1 times [2025-03-03 15:42:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:31,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887775629] [2025-03-03 15:42:31,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:31,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:42:31,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:42:31,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:31,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:31,957 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:42:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887775629] [2025-03-03 15:42:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887775629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891859639] [2025-03-03 15:42:31,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:31,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:31,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:31,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:31,960 INFO L87 Difference]: Start difference. First operand 2254 states and 4148 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:42:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:32,325 INFO L93 Difference]: Finished difference Result 2514 states and 4530 transitions. [2025-03-03 15:42:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:42:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:32,335 INFO L225 Difference]: With dead ends: 2514 [2025-03-03 15:42:32,336 INFO L226 Difference]: Without dead ends: 2391 [2025-03-03 15:42:32,337 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:42:32,338 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4247 mSDsluCounter, 12585 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4257 SdHoareTripleChecker+Valid, 16781 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:32,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4257 Valid, 16781 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:42:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2025-03-03 15:42:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2379. [2025-03-03 15:42:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2334 states have (on average 1.8281919451585262) internal successors, (4267), 2338 states have internal predecessors, (4267), 29 states have call successors, (29), 12 states have call predecessors, (29), 14 states have return successors, (36), 30 states have call predecessors, (36), 29 states have call successors, (36) [2025-03-03 15:42:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 4332 transitions. [2025-03-03 15:42:32,394 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 4332 transitions. Word has length 68 [2025-03-03 15:42:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:32,395 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 4332 transitions. [2025-03-03 15:42:32,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:42:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 4332 transitions. [2025-03-03 15:42:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:42:32,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:32,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:32,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:42:32,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1669925196, now seen corresponding path program 1 times [2025-03-03 15:42:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787904978] [2025-03-03 15:42:32,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:32,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:42:32,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:42:32,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:32,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:32,514 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:42:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787904978] [2025-03-03 15:42:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787904978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773015431] [2025-03-03 15:42:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:32,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:32,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:32,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:32,516 INFO L87 Difference]: Start difference. First operand 2379 states and 4332 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:42:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:32,854 INFO L93 Difference]: Finished difference Result 2913 states and 5112 transitions. [2025-03-03 15:42:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:42:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:32,866 INFO L225 Difference]: With dead ends: 2913 [2025-03-03 15:42:32,867 INFO L226 Difference]: Without dead ends: 2667 [2025-03-03 15:42:32,868 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:42:32,869 INFO L435 NwaCegarLoop]: 4172 mSDtfsCounter, 4318 mSDsluCounter, 12521 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4331 SdHoareTripleChecker+Valid, 16693 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:32,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4331 Valid, 16693 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-03-03 15:42:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2609. [2025-03-03 15:42:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2528 states have (on average 1.798259493670886) internal successors, (4546), 2536 states have internal predecessors, (4546), 49 states have call successors, (49), 24 states have call predecessors, (49), 30 states have return successors, (72), 52 states have call predecessors, (72), 49 states have call successors, (72) [2025-03-03 15:42:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4667 transitions. [2025-03-03 15:42:33,007 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4667 transitions. Word has length 68 [2025-03-03 15:42:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:33,008 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4667 transitions. [2025-03-03 15:42:33,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:42:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4667 transitions. [2025-03-03 15:42:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:42:33,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:33,009 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] [2025-03-03 15:42:33,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:42:33,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1855872085, now seen corresponding path program 1 times [2025-03-03 15:42:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573661223] [2025-03-03 15:42:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:33,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:42:33,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:42:33,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:33,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:33,103 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:42:33,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573661223] [2025-03-03 15:42:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573661223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:33,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694398025] [2025-03-03 15:42:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:33,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:33,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:33,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:33,104 INFO L87 Difference]: Start difference. First operand 2609 states and 4667 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:42:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:33,321 INFO L93 Difference]: Finished difference Result 3114 states and 5421 transitions. [2025-03-03 15:42:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:33,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:42:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:33,331 INFO L225 Difference]: With dead ends: 3114 [2025-03-03 15:42:33,331 INFO L226 Difference]: Without dead ends: 2636 [2025-03-03 15:42:33,333 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:42:33,334 INFO L435 NwaCegarLoop]: 4088 mSDtfsCounter, 4180 mSDsluCounter, 8120 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4190 SdHoareTripleChecker+Valid, 12208 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:33,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4190 Valid, 12208 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:42:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-03 15:42:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2609. [2025-03-03 15:42:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2528 states have (on average 1.7962816455696202) internal successors, (4541), 2536 states have internal predecessors, (4541), 49 states have call successors, (49), 24 states have call predecessors, (49), 30 states have return successors, (72), 52 states have call predecessors, (72), 49 states have call successors, (72) [2025-03-03 15:42:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4662 transitions. [2025-03-03 15:42:33,420 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4662 transitions. Word has length 68 [2025-03-03 15:42:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4662 transitions. [2025-03-03 15:42:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:42:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4662 transitions. [2025-03-03 15:42:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:42:33,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:33,422 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] [2025-03-03 15:42:33,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:42:33,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:33,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash -722681492, now seen corresponding path program 1 times [2025-03-03 15:42:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:33,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834575810] [2025-03-03 15:42:33,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:33,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:42:33,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:42:33,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:33,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:33,548 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:42:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:33,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834575810] [2025-03-03 15:42:33,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834575810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:33,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:33,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068029476] [2025-03-03 15:42:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:33,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:33,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:33,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:33,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:33,551 INFO L87 Difference]: Start difference. First operand 2609 states and 4662 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:42:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:33,943 INFO L93 Difference]: Finished difference Result 3589 states and 6089 transitions. [2025-03-03 15:42:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:42:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:33,957 INFO L225 Difference]: With dead ends: 3589 [2025-03-03 15:42:33,958 INFO L226 Difference]: Without dead ends: 3113 [2025-03-03 15:42:33,961 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:42:33,962 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4245 mSDsluCounter, 12484 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4258 SdHoareTripleChecker+Valid, 16646 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:33,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4258 Valid, 16646 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2025-03-03 15:42:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 3069. [2025-03-03 15:42:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2912 states have (on average 1.7455357142857142) internal successors, (5083), 2934 states have internal predecessors, (5083), 87 states have call successors, (87), 48 states have call predecessors, (87), 68 states have return successors, (166), 94 states have call predecessors, (166), 87 states have call successors, (166) [2025-03-03 15:42:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 5336 transitions. [2025-03-03 15:42:34,086 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 5336 transitions. Word has length 68 [2025-03-03 15:42:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:34,087 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 5336 transitions. [2025-03-03 15:42:34,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:42:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 5336 transitions. [2025-03-03 15:42:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:42:34,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:34,091 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] [2025-03-03 15:42:34,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:42:34,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:34,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash -963221621, now seen corresponding path program 1 times [2025-03-03 15:42:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191889951] [2025-03-03 15:42:34,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:34,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:42:34,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:42:34,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:34,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:34,153 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:42:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191889951] [2025-03-03 15:42:34,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191889951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:34,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:42:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150882220] [2025-03-03 15:42:34,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:34,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:42:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:34,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:42:34,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:42:34,155 INFO L87 Difference]: Start difference. First operand 3069 states and 5336 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:42:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:34,335 INFO L93 Difference]: Finished difference Result 4897 states and 8037 transitions. [2025-03-03 15:42:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 68 [2025-03-03 15:42:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:34,354 INFO L225 Difference]: With dead ends: 4897 [2025-03-03 15:42:34,354 INFO L226 Difference]: Without dead ends: 3961 [2025-03-03 15:42:34,359 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:42:34,359 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4272 mSDsluCounter, 4239 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4272 SdHoareTripleChecker+Valid, 8537 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:34,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4272 Valid, 8537 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:42:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2025-03-03 15:42:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3953. [2025-03-03 15:42:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 3647 states have (on average 1.6682204551686317) internal successors, (6084), 3697 states have internal predecessors, (6084), 168 states have call successors, (168), 96 states have call predecessors, (168), 136 states have return successors, (311), 167 states have call predecessors, (311), 168 states have call successors, (311) [2025-03-03 15:42:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 6563 transitions. [2025-03-03 15:42:34,477 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 6563 transitions. Word has length 68 [2025-03-03 15:42:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:34,478 INFO L471 AbstractCegarLoop]: Abstraction has 3953 states and 6563 transitions. [2025-03-03 15:42:34,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:42:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 6563 transitions. [2025-03-03 15:42:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:42:34,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:34,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:42:34,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:34,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1365497866, now seen corresponding path program 1 times [2025-03-03 15:42:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:34,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179027274] [2025-03-03 15:42:34,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:34,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:42:34,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:42:34,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:34,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:34,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179027274] [2025-03-03 15:42:34,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179027274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810763597] [2025-03-03 15:42:34,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:34,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:34,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:34,552 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:34,553 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:34,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:42:34,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:42:34,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:34,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:34,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:34,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:42:34,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810763597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475144118] [2025-03-03 15:42:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:34,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:34,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:34,679 INFO L87 Difference]: Start difference. First operand 3953 states and 6563 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:34,864 INFO L93 Difference]: Finished difference Result 7535 states and 11695 transitions. [2025-03-03 15:42:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 112 [2025-03-03 15:42:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:34,886 INFO L225 Difference]: With dead ends: 7535 [2025-03-03 15:42:34,886 INFO L226 Difference]: Without dead ends: 5715 [2025-03-03 15:42:34,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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:34,892 INFO L435 NwaCegarLoop]: 4142 mSDtfsCounter, 4101 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4101 SdHoareTripleChecker+Valid, 4304 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:34,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4101 Valid, 4304 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:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-03-03 15:42:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 5665. [2025-03-03 15:42:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 5069 states have (on average 1.5888735450779246) internal successors, (8054), 5167 states have internal predecessors, (8054), 322 states have call successors, (322), 192 states have call predecessors, (322), 272 states have return successors, (593), 313 states have call predecessors, (593), 322 states have call successors, (593) [2025-03-03 15:42:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 8969 transitions. [2025-03-03 15:42:35,087 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 8969 transitions. Word has length 112 [2025-03-03 15:42:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:35,087 INFO L471 AbstractCegarLoop]: Abstraction has 5665 states and 8969 transitions. [2025-03-03 15:42:35,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 8969 transitions. [2025-03-03 15:42:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:42:35,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:35,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,101 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:35,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:35,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:35,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash 363975056, now seen corresponding path program 1 times [2025-03-03 15:42:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:35,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885867084] [2025-03-03 15:42:35,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:35,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:42:35,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:42:35,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:35,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885867084] [2025-03-03 15:42:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885867084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705945672] [2025-03-03 15:42:35,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:35,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:35,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:35,376 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:35,377 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:35,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:42:35,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:42:35,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:35,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:35,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:35,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:42:35,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705945672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013961515] [2025-03-03 15:42:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:35,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:35,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:35,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:35,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:35,499 INFO L87 Difference]: Start difference. First operand 5665 states and 8969 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:35,776 INFO L93 Difference]: Finished difference Result 12615 states and 18883 transitions. [2025-03-03 15:42:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:35,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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 112 [2025-03-03 15:42:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:35,816 INFO L225 Difference]: With dead ends: 12615 [2025-03-03 15:42:35,816 INFO L226 Difference]: Without dead ends: 9083 [2025-03-03 15:42:35,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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:35,825 INFO L435 NwaCegarLoop]: 4142 mSDtfsCounter, 4107 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 4304 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:35,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 4304 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:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2025-03-03 15:42:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 8985. [2025-03-03 15:42:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8985 states, 7817 states have (on average 1.5159268261481387) internal successors, (11850), 8011 states have internal predecessors, (11850), 622 states have call successors, (622), 384 states have call predecessors, (622), 544 states have return successors, (1149), 597 states have call predecessors, (1149), 622 states have call successors, (1149) [2025-03-03 15:42:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8985 states to 8985 states and 13621 transitions. [2025-03-03 15:42:36,131 INFO L78 Accepts]: Start accepts. Automaton has 8985 states and 13621 transitions. Word has length 112 [2025-03-03 15:42:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:36,131 INFO L471 AbstractCegarLoop]: Abstraction has 8985 states and 13621 transitions. [2025-03-03 15:42:36,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 8985 states and 13621 transitions. [2025-03-03 15:42:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:42:36,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:36,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:42:36,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 15:42:36,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1281625750, now seen corresponding path program 1 times [2025-03-03 15:42:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660018] [2025-03-03 15:42:36,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:36,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:42:36,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:42:36,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:36,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:36,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:36,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660018] [2025-03-03 15:42:36,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:36,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455035581] [2025-03-03 15:42:36,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:36,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:36,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:36,419 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:36,420 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:36,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:42:36,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:42:36,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:36,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:36,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:36,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 15:42:36,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:36,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455035581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:36,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:36,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966377568] [2025-03-03 15:42:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:36,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:36,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:36,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:36,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:36,529 INFO L87 Difference]: Start difference. First operand 8985 states and 13621 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:42:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:36,944 INFO L93 Difference]: Finished difference Result 22071 states and 32446 transitions. [2025-03-03 15:42:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2025-03-03 15:42:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:37,004 INFO L225 Difference]: With dead ends: 22071 [2025-03-03 15:42:37,004 INFO L226 Difference]: Without dead ends: 15221 [2025-03-03 15:42:37,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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:37,029 INFO L435 NwaCegarLoop]: 4301 mSDtfsCounter, 156 mSDsluCounter, 4139 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 8440 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:37,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 8440 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15221 states. [2025-03-03 15:42:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15221 to 15221. [2025-03-03 15:42:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15221 states, 13024 states have (on average 1.4609183046683047) internal successors, (19027), 13379 states have internal predecessors, (19027), 1143 states have call successors, (1143), 732 states have call predecessors, (1143), 1052 states have return successors, (2331), 1125 states have call predecessors, (2331), 1143 states have call successors, (2331) [2025-03-03 15:42:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15221 states to 15221 states and 22501 transitions. [2025-03-03 15:42:37,871 INFO L78 Accepts]: Start accepts. Automaton has 15221 states and 22501 transitions. Word has length 112 [2025-03-03 15:42:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:37,872 INFO L471 AbstractCegarLoop]: Abstraction has 15221 states and 22501 transitions. [2025-03-03 15:42:37,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:42:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 15221 states and 22501 transitions. [2025-03-03 15:42:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:42:37,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:37,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:42:38,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:38,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2110809421, now seen corresponding path program 1 times [2025-03-03 15:42:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942241611] [2025-03-03 15:42:38,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:38,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:42:38,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:42:38,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:38,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:42:38,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942241611] [2025-03-03 15:42:38,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942241611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:38,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589373156] [2025-03-03 15:42:38,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:38,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:38,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:38,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:38,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:42:38,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:42:38,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:42:38,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:38,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:38,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:38,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 15:42:38,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589373156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487337860] [2025-03-03 15:42:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:38,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:38,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:38,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:38,402 INFO L87 Difference]: Start difference. First operand 15221 states and 22501 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:42:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:38,778 INFO L93 Difference]: Finished difference Result 23477 states and 34580 transitions. [2025-03-03 15:42:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:38,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-03-03 15:42:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:38,821 INFO L225 Difference]: With dead ends: 23477 [2025-03-03 15:42:38,821 INFO L226 Difference]: Without dead ends: 13375 [2025-03-03 15:42:38,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 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:38,847 INFO L435 NwaCegarLoop]: 4139 mSDtfsCounter, 4074 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 4173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:38,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 4173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13375 states. [2025-03-03 15:42:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13375 to 13303. [2025-03-03 15:42:39,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13303 states, 11534 states have (on average 1.4374024622854171) internal successors, (16579), 11715 states have internal predecessors, (16579), 965 states have call successors, (965), 650 states have call predecessors, (965), 802 states have return successors, (1595), 947 states have call predecessors, (1595), 965 states have call successors, (1595) [2025-03-03 15:42:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 19139 transitions. [2025-03-03 15:42:39,250 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 19139 transitions. Word has length 164 [2025-03-03 15:42:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:39,251 INFO L471 AbstractCegarLoop]: Abstraction has 13303 states and 19139 transitions. [2025-03-03 15:42:39,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:42:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 19139 transitions. [2025-03-03 15:42:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:42:39,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:39,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:42:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:39,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:39,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash 308746920, now seen corresponding path program 1 times [2025-03-03 15:42:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779639164] [2025-03-03 15:42:39,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:39,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:42:39,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:42:39,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:42:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779639164] [2025-03-03 15:42:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779639164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257129679] [2025-03-03 15:42:39,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:39,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:39,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:39,557 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:39,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:42:39,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:42:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:42:39,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:39,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:39,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:39,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:42:39,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:39,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257129679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:39,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:39,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896541054] [2025-03-03 15:42:39,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:39,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:39,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:39,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:39,714 INFO L87 Difference]: Start difference. First operand 13303 states and 19139 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:42:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:40,021 INFO L93 Difference]: Finished difference Result 21651 states and 30916 transitions. [2025-03-03 15:42:40,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:40,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-03-03 15:42:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:40,057 INFO L225 Difference]: With dead ends: 21651 [2025-03-03 15:42:40,057 INFO L226 Difference]: Without dead ends: 11919 [2025-03-03 15:42:40,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 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:40,077 INFO L435 NwaCegarLoop]: 4138 mSDtfsCounter, 4089 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:40,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4171 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11919 states. [2025-03-03 15:42:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11919 to 11899. [2025-03-03 15:42:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11899 states, 10444 states have (on average 1.4201455381080046) internal successors, (14832), 10536 states have internal predecessors, (14832), 811 states have call successors, (811), 574 states have call predecessors, (811), 642 states have return successors, (1167), 794 states have call predecessors, (1167), 811 states have call successors, (1167) [2025-03-03 15:42:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11899 states to 11899 states and 16810 transitions. [2025-03-03 15:42:40,402 INFO L78 Accepts]: Start accepts. Automaton has 11899 states and 16810 transitions. Word has length 164 [2025-03-03 15:42:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:40,402 INFO L471 AbstractCegarLoop]: Abstraction has 11899 states and 16810 transitions. [2025-03-03 15:42:40,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:42:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 11899 states and 16810 transitions. [2025-03-03 15:42:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:42:40,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:40,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:42:40,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 15:42:40,617 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:40,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash -276938393, now seen corresponding path program 1 times [2025-03-03 15:42:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:40,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218777615] [2025-03-03 15:42:40,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:40,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:42:40,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:42:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:42:40,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218777615] [2025-03-03 15:42:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218777615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142074061] [2025-03-03 15:42:40,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:40,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:40,689 INFO L229 MonitoredProcess]: Starting monitored process 7 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:40,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:42:40,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:42:40,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:42:40,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:40,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:40,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:42:40,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 15:42:40,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:40,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142074061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:40,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:40,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468607925] [2025-03-03 15:42:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:40,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:40,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:40,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:40,823 INFO L87 Difference]: Start difference. First operand 11899 states and 16810 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:42:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:41,168 INFO L93 Difference]: Finished difference Result 20294 states and 27761 transitions. [2025-03-03 15:42:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 164 [2025-03-03 15:42:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:41,213 INFO L225 Difference]: With dead ends: 20294 [2025-03-03 15:42:41,214 INFO L226 Difference]: Without dead ends: 12833 [2025-03-03 15:42:41,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 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:41,230 INFO L435 NwaCegarLoop]: 4185 mSDtfsCounter, 4084 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:41,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4351 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12833 states. [2025-03-03 15:42:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12833 to 12728. [2025-03-03 15:42:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11231 states have (on average 1.3939097141839552) internal successors, (15655), 11323 states have internal predecessors, (15655), 811 states have call successors, (811), 616 states have call predecessors, (811), 684 states have return successors, (1209), 794 states have call predecessors, (1209), 811 states have call successors, (1209) [2025-03-03 15:42:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 17675 transitions. [2025-03-03 15:42:41,725 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 17675 transitions. Word has length 164 [2025-03-03 15:42:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:41,726 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 17675 transitions. [2025-03-03 15:42:41,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:42:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 17675 transitions. [2025-03-03 15:42:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 15:42:41,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:41,744 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:42:41,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:41,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:41,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash -688111560, now seen corresponding path program 1 times [2025-03-03 15:42:41,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:41,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667367522] [2025-03-03 15:42:41,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:41,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 15:42:41,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 15:42:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:42:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667367522] [2025-03-03 15:42:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667367522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106210060] [2025-03-03 15:42:42,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:42,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:42,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:42,050 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:42:42,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 15:42:42,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 15:42:42,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:42,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:42,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:42,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 15:42:42,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:42,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106210060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:42,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901613500] [2025-03-03 15:42:42,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:42,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:42,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:42,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:42,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:42,198 INFO L87 Difference]: Start difference. First operand 12728 states and 17675 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:42:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:43,157 INFO L93 Difference]: Finished difference Result 32632 states and 43853 transitions. [2025-03-03 15:42:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 165 [2025-03-03 15:42:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:43,242 INFO L225 Difference]: With dead ends: 32632 [2025-03-03 15:42:43,242 INFO L226 Difference]: Without dead ends: 22047 [2025-03-03 15:42:43,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 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:43,272 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 139 mSDsluCounter, 4133 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 8425 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:43,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 8425 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22047 states. [2025-03-03 15:42:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22047 to 22045. [2025-03-03 15:42:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22045 states, 19166 states have (on average 1.3391944067619743) internal successors, (25667), 19349 states have internal predecessors, (25667), 1565 states have call successors, (1565), 1176 states have call predecessors, (1565), 1312 states have return successors, (2699), 1531 states have call predecessors, (2699), 1565 states have call successors, (2699) [2025-03-03 15:42:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22045 states to 22045 states and 29931 transitions. [2025-03-03 15:42:44,027 INFO L78 Accepts]: Start accepts. Automaton has 22045 states and 29931 transitions. Word has length 165 [2025-03-03 15:42:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:44,028 INFO L471 AbstractCegarLoop]: Abstraction has 22045 states and 29931 transitions. [2025-03-03 15:42:44,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:42:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22045 states and 29931 transitions. [2025-03-03 15:42:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:42:44,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:44,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:42:44,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:44,250 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:44,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1375426545, now seen corresponding path program 1 times [2025-03-03 15:42:44,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:44,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687064563] [2025-03-03 15:42:44,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:44,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:44,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:44,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:44,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 15:42:44,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687064563] [2025-03-03 15:42:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687064563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398177408] [2025-03-03 15:42:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:44,322 INFO L229 MonitoredProcess]: Starting monitored process 9 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:44,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:42:44,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:44,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:44,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:44,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:44,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 15:42:44,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398177408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925923942] [2025-03-03 15:42:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:44,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:44,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:44,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:44,468 INFO L87 Difference]: Start difference. First operand 22045 states and 29931 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:42:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:45,060 INFO L93 Difference]: Finished difference Result 43215 states and 58408 transitions. [2025-03-03 15:42:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:45,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-03-03 15:42:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:45,127 INFO L225 Difference]: With dead ends: 43215 [2025-03-03 15:42:45,127 INFO L226 Difference]: Without dead ends: 23325 [2025-03-03 15:42:45,159 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:45,159 INFO L435 NwaCegarLoop]: 4141 mSDtfsCounter, 4096 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4096 SdHoareTripleChecker+Valid, 4173 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:45,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4096 Valid, 4173 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23325 states. [2025-03-03 15:42:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23325 to 22045. [2025-03-03 15:42:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22045 states, 19166 states have (on average 1.3141500573933007) internal successors, (25187), 19349 states have internal predecessors, (25187), 1565 states have call successors, (1565), 1176 states have call predecessors, (1565), 1312 states have return successors, (2573), 1531 states have call predecessors, (2573), 1565 states have call successors, (2573) [2025-03-03 15:42:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22045 states to 22045 states and 29325 transitions. [2025-03-03 15:42:45,874 INFO L78 Accepts]: Start accepts. Automaton has 22045 states and 29325 transitions. Word has length 166 [2025-03-03 15:42:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 22045 states and 29325 transitions. [2025-03-03 15:42:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:42:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22045 states and 29325 transitions. [2025-03-03 15:42:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:42:45,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:45,893 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:42:46,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 15:42:46,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:46,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash -766321137, now seen corresponding path program 1 times [2025-03-03 15:42:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069720831] [2025-03-03 15:42:46,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:46,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:46,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:46,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:46,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:46,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 15:42:46,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:46,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069720831] [2025-03-03 15:42:46,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069720831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356976145] [2025-03-03 15:42:46,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:46,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:46,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:46,159 INFO L229 MonitoredProcess]: Starting monitored process 10 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:46,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:42:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:46,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:46,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:46,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:46,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:46,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:42:46,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356976145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:46,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25182996] [2025-03-03 15:42:46,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:46,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:46,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:46,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:46,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:46,271 INFO L87 Difference]: Start difference. First operand 22045 states and 29325 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:42:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:47,379 INFO L93 Difference]: Finished difference Result 59295 states and 77593 transitions. [2025-03-03 15:42:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:47,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-03-03 15:42:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:47,521 INFO L225 Difference]: With dead ends: 59295 [2025-03-03 15:42:47,521 INFO L226 Difference]: Without dead ends: 39405 [2025-03-03 15:42:47,558 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:47,558 INFO L435 NwaCegarLoop]: 4290 mSDtfsCounter, 146 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 8421 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:47,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 8421 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39405 states. [2025-03-03 15:42:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39405 to 39403. [2025-03-03 15:42:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39403 states, 33872 states have (on average 1.2722307510628248) internal successors, (43093), 34237 states have internal predecessors, (43093), 3017 states have call successors, (3017), 2240 states have call predecessors, (3017), 2512 states have return successors, (5697), 2949 states have call predecessors, (5697), 3017 states have call successors, (5697) [2025-03-03 15:42:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39403 states to 39403 states and 51807 transitions. [2025-03-03 15:42:49,577 INFO L78 Accepts]: Start accepts. Automaton has 39403 states and 51807 transitions. Word has length 166 [2025-03-03 15:42:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:49,577 INFO L471 AbstractCegarLoop]: Abstraction has 39403 states and 51807 transitions. [2025-03-03 15:42:49,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:42:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39403 states and 51807 transitions. [2025-03-03 15:42:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:42:49,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:49,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 15:42:49,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 15:42:49,806 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:49,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1262156672, now seen corresponding path program 1 times [2025-03-03 15:42:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:49,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984435415] [2025-03-03 15:42:49,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:49,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:49,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 15:42:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984435415] [2025-03-03 15:42:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984435415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330064902] [2025-03-03 15:42:49,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:49,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:49,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:49,867 INFO L229 MonitoredProcess]: Starting monitored process 11 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:49,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:42:49,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:49,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:49,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:49,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:49,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:42:50,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 15:42:50,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:50,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330064902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:50,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:50,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012043107] [2025-03-03 15:42:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:50,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:50,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:50,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:50,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:50,105 INFO L87 Difference]: Start difference. First operand 39403 states and 51807 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:42:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:51,150 INFO L93 Difference]: Finished difference Result 70693 states and 92129 transitions. [2025-03-03 15:42:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2025-03-03 15:42:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:51,305 INFO L225 Difference]: With dead ends: 70693 [2025-03-03 15:42:51,305 INFO L226 Difference]: Without dead ends: 40081 [2025-03-03 15:42:51,374 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:51,376 INFO L435 NwaCegarLoop]: 4161 mSDtfsCounter, 4092 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:51,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4323 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40081 states. [2025-03-03 15:42:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40081 to 39319. [2025-03-03 15:42:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39319 states, 33788 states have (on average 1.2642062270628625) internal successors, (42715), 34153 states have internal predecessors, (42715), 3017 states have call successors, (3017), 2240 states have call predecessors, (3017), 2512 states have return successors, (5697), 2949 states have call predecessors, (5697), 3017 states have call successors, (5697) [2025-03-03 15:42:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39319 states to 39319 states and 51429 transitions. [2025-03-03 15:42:53,114 INFO L78 Accepts]: Start accepts. Automaton has 39319 states and 51429 transitions. Word has length 166 [2025-03-03 15:42:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:53,115 INFO L471 AbstractCegarLoop]: Abstraction has 39319 states and 51429 transitions. [2025-03-03 15:42:53,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:42:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 39319 states and 51429 transitions. [2025-03-03 15:42:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:42:53,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:53,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 15:42:53,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:42:53,348 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:53,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash -558376095, now seen corresponding path program 1 times [2025-03-03 15:42:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179731588] [2025-03-03 15:42:53,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:53,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:42:53,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:42:53,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:53,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 15:42:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179731588] [2025-03-03 15:42:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179731588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:53,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:53,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:42:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022526516] [2025-03-03 15:42:53,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:53,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:53,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:53,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:53,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:42:53,379 INFO L87 Difference]: Start difference. First operand 39319 states and 51429 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:42:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:54,821 INFO L93 Difference]: Finished difference Result 69855 states and 90254 transitions. [2025-03-03 15:42:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:54,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 166 [2025-03-03 15:42:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:54,935 INFO L225 Difference]: With dead ends: 69855 [2025-03-03 15:42:54,935 INFO L226 Difference]: Without dead ends: 32683 [2025-03-03 15:42:54,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:42:54,989 INFO L435 NwaCegarLoop]: 4136 mSDtfsCounter, 173 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 8094 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:54,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 8094 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32683 states. [2025-03-03 15:42:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32683 to 32683. [2025-03-03 15:42:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32683 states, 28188 states have (on average 1.2751880232723145) internal successors, (35945), 28477 states have internal predecessors, (35945), 2445 states have call successors, (2445), 1832 states have call predecessors, (2445), 2048 states have return successors, (4449), 2385 states have call predecessors, (4449), 2445 states have call successors, (4449) [2025-03-03 15:42:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32683 states to 32683 states and 42839 transitions. [2025-03-03 15:42:56,318 INFO L78 Accepts]: Start accepts. Automaton has 32683 states and 42839 transitions. Word has length 166 [2025-03-03 15:42:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:56,319 INFO L471 AbstractCegarLoop]: Abstraction has 32683 states and 42839 transitions. [2025-03-03 15:42:56,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:42:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 32683 states and 42839 transitions. [2025-03-03 15:42:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:42:56,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:56,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:42:56,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:56,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1163232919, now seen corresponding path program 1 times [2025-03-03 15:42:56,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:56,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927759149] [2025-03-03 15:42:56,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:56,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:42:56,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:42:56,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:56,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 15:42:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927759149] [2025-03-03 15:42:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927759149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972563587] [2025-03-03 15:42:56,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:56,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:56,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:56,405 INFO L229 MonitoredProcess]: Starting monitored process 12 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:56,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 15:42:56,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:42:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:42:56,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:56,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:56,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:42:56,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 15:42:56,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:56,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972563587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:56,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:56,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378545107] [2025-03-03 15:42:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:56,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:56,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:56,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:56,562 INFO L87 Difference]: Start difference. First operand 32683 states and 42839 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:42:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:58,167 INFO L93 Difference]: Finished difference Result 58072 states and 75157 transitions. [2025-03-03 15:42:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 167 [2025-03-03 15:42:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:58,403 INFO L225 Difference]: With dead ends: 58072 [2025-03-03 15:42:58,403 INFO L226 Difference]: Without dead ends: 32993 [2025-03-03 15:42:58,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 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:58,434 INFO L435 NwaCegarLoop]: 4152 mSDtfsCounter, 4090 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:58,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 4312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32993 states. [2025-03-03 15:42:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32993 to 32683. [2025-03-03 15:42:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32683 states, 28188 states have (on average 1.2694408968355329) internal successors, (35783), 28477 states have internal predecessors, (35783), 2445 states have call successors, (2445), 1832 states have call predecessors, (2445), 2048 states have return successors, (4449), 2385 states have call predecessors, (4449), 2445 states have call successors, (4449) [2025-03-03 15:42:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32683 states to 32683 states and 42677 transitions. [2025-03-03 15:42:59,698 INFO L78 Accepts]: Start accepts. Automaton has 32683 states and 42677 transitions. Word has length 167 [2025-03-03 15:42:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:59,699 INFO L471 AbstractCegarLoop]: Abstraction has 32683 states and 42677 transitions. [2025-03-03 15:42:59,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:42:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 32683 states and 42677 transitions. [2025-03-03 15:42:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:42:59,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:59,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 15:42:59,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 15:42:59,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash -971834967, now seen corresponding path program 1 times [2025-03-03 15:42:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684530348] [2025-03-03 15:42:59,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:59,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:42:59,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:42:59,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:59,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 15:42:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684530348] [2025-03-03 15:42:59,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684530348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:59,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:59,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:42:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863846916] [2025-03-03 15:42:59,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:59,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:59,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:59,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:42:59,944 INFO L87 Difference]: Start difference. First operand 32683 states and 42677 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:43:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:00,836 INFO L93 Difference]: Finished difference Result 57766 states and 74368 transitions. [2025-03-03 15:43:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 167 [2025-03-03 15:43:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:00,934 INFO L225 Difference]: With dead ends: 57766 [2025-03-03 15:43:00,935 INFO L226 Difference]: Without dead ends: 27222 [2025-03-03 15:43:00,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:43:00,984 INFO L435 NwaCegarLoop]: 4135 mSDtfsCounter, 171 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 8093 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:00,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 8093 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27222 states. [2025-03-03 15:43:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27222 to 27222. [2025-03-03 15:43:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27222 states, 23569 states have (on average 1.2817259960117102) internal successors, (30209), 23799 states have internal predecessors, (30209), 1983 states have call successors, (1983), 1496 states have call predecessors, (1983), 1668 states have return successors, (3487), 1932 states have call predecessors, (3487), 1983 states have call successors, (3487) [2025-03-03 15:43:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27222 states to 27222 states and 35679 transitions. [2025-03-03 15:43:02,579 INFO L78 Accepts]: Start accepts. Automaton has 27222 states and 35679 transitions. Word has length 167 [2025-03-03 15:43:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:02,580 INFO L471 AbstractCegarLoop]: Abstraction has 27222 states and 35679 transitions. [2025-03-03 15:43:02,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:43:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 27222 states and 35679 transitions. [2025-03-03 15:43:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:43:02,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:02,598 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:02,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:43:02,598 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash -301390752, now seen corresponding path program 1 times [2025-03-03 15:43:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675841498] [2025-03-03 15:43:02,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:43:02,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:43:02,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:02,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 15:43:02,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675841498] [2025-03-03 15:43:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675841498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:02,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836014759] [2025-03-03 15:43:02,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:02,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:02,671 INFO L229 MonitoredProcess]: Starting monitored process 13 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:43:02,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 15:43:02,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:43:02,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:43:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:02,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:02,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:43:02,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:43:02,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:02,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836014759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:02,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:02,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:43:02,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620482707] [2025-03-03 15:43:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:02,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:02,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:02,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:02,811 INFO L87 Difference]: Start difference. First operand 27222 states and 35679 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:04,264 INFO L93 Difference]: Finished difference Result 46638 states and 61585 transitions. [2025-03-03 15:43:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:04,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 170 [2025-03-03 15:43:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:04,364 INFO L225 Difference]: With dead ends: 46638 [2025-03-03 15:43:04,365 INFO L226 Difference]: Without dead ends: 27216 [2025-03-03 15:43:04,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 170 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:43:04,400 INFO L435 NwaCegarLoop]: 4266 mSDtfsCounter, 124 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 8384 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:04,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 8384 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27216 states. [2025-03-03 15:43:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27216 to 27110. [2025-03-03 15:43:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27110 states, 23457 states have (on average 1.261926077503517) internal successors, (29601), 23687 states have internal predecessors, (29601), 1983 states have call successors, (1983), 1496 states have call predecessors, (1983), 1668 states have return successors, (3487), 1932 states have call predecessors, (3487), 1983 states have call successors, (3487) [2025-03-03 15:43:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27110 states to 27110 states and 35071 transitions. [2025-03-03 15:43:05,484 INFO L78 Accepts]: Start accepts. Automaton has 27110 states and 35071 transitions. Word has length 170 [2025-03-03 15:43:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:05,484 INFO L471 AbstractCegarLoop]: Abstraction has 27110 states and 35071 transitions. [2025-03-03 15:43:05,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27110 states and 35071 transitions. [2025-03-03 15:43:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 15:43:05,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:05,499 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:05,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:05,699 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:05,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1637278897, now seen corresponding path program 1 times [2025-03-03 15:43:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192876206] [2025-03-03 15:43:05,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:05,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 15:43:05,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 15:43:05,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:05,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 15:43:05,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192876206] [2025-03-03 15:43:05,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192876206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999642529] [2025-03-03 15:43:05,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:05,754 INFO L229 MonitoredProcess]: Starting monitored process 14 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:43:05,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 15:43:05,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 15:43:05,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 15:43:05,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:05,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:05,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:43:05,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:43:05,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:05,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999642529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:05,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:05,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:43:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668094412] [2025-03-03 15:43:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:05,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:05,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:05,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:05,902 INFO L87 Difference]: Start difference. First operand 27110 states and 35071 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:07,506 INFO L93 Difference]: Finished difference Result 46448 states and 60529 transitions. [2025-03-03 15:43:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:07,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 171 [2025-03-03 15:43:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:07,643 INFO L225 Difference]: With dead ends: 46448 [2025-03-03 15:43:07,643 INFO L226 Difference]: Without dead ends: 27104 [2025-03-03 15:43:07,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 171 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:43:07,700 INFO L435 NwaCegarLoop]: 4254 mSDtfsCounter, 101 mSDsluCounter, 4116 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 8370 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:07,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 8370 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27104 states. [2025-03-03 15:43:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27104 to 26998. [2025-03-03 15:43:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26998 states, 23345 states have (on average 1.241936174769758) internal successors, (28993), 23575 states have internal predecessors, (28993), 1983 states have call successors, (1983), 1496 states have call predecessors, (1983), 1668 states have return successors, (3487), 1932 states have call predecessors, (3487), 1983 states have call successors, (3487) [2025-03-03 15:43:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26998 states to 26998 states and 34463 transitions. [2025-03-03 15:43:09,130 INFO L78 Accepts]: Start accepts. Automaton has 26998 states and 34463 transitions. Word has length 171 [2025-03-03 15:43:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:09,130 INFO L471 AbstractCegarLoop]: Abstraction has 26998 states and 34463 transitions. [2025-03-03 15:43:09,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 26998 states and 34463 transitions. [2025-03-03 15:43:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:43:09,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:09,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:09,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:09,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 15:43:09,344 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:09,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:09,344 INFO L85 PathProgramCache]: Analyzing trace with hash -271918878, now seen corresponding path program 1 times [2025-03-03 15:43:09,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:09,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564712018] [2025-03-03 15:43:09,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:09,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:09,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:09,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:09,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:09,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:09,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564712018] [2025-03-03 15:43:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564712018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:09,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471781304] [2025-03-03 15:43:09,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:09,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:09,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:09,385 INFO L229 MonitoredProcess]: Starting monitored process 15 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:43:09,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 15:43:09,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:09,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:09,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:43:09,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 15:43:09,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:09,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471781304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:09,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:09,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-03 15:43:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739220528] [2025-03-03 15:43:09,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:09,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:09,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:09,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:43:09,550 INFO L87 Difference]: Start difference. First operand 26998 states and 34463 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:43:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:10,789 INFO L93 Difference]: Finished difference Result 36512 states and 46141 transitions. [2025-03-03 15:43:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:43:10,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2025-03-03 15:43:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:10,897 INFO L225 Difference]: With dead ends: 36512 [2025-03-03 15:43:10,898 INFO L226 Difference]: Without dead ends: 31427 [2025-03-03 15:43:10,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:43:10,924 INFO L435 NwaCegarLoop]: 4091 mSDtfsCounter, 4194 mSDsluCounter, 8205 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4203 SdHoareTripleChecker+Valid, 12296 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:10,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4203 Valid, 12296 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:43:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31427 states. [2025-03-03 15:43:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31427 to 17641. [2025-03-03 15:43:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17641 states, 15412 states have (on average 1.2690760446405398) internal successors, (19559), 15519 states have internal predecessors, (19559), 1227 states have call successors, (1227), 928 states have call predecessors, (1227), 1000 states have return successors, (1844), 1197 states have call predecessors, (1844), 1227 states have call successors, (1844) [2025-03-03 15:43:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 22630 transitions. [2025-03-03 15:43:12,073 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 22630 transitions. Word has length 172 [2025-03-03 15:43:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:12,073 INFO L471 AbstractCegarLoop]: Abstraction has 17641 states and 22630 transitions. [2025-03-03 15:43:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:43:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 22630 transitions. [2025-03-03 15:43:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:43:12,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:12,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:12,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:12,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:12,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:12,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash -745944861, now seen corresponding path program 1 times [2025-03-03 15:43:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730066862] [2025-03-03 15:43:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:12,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:12,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:12,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:12,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730066862] [2025-03-03 15:43:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730066862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430757553] [2025-03-03 15:43:12,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:12,355 INFO L229 MonitoredProcess]: Starting monitored process 16 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:43:12,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 15:43:12,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:12,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:12,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:12,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:12,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:43:12,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 15:43:12,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430757553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:12,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-03 15:43:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936360858] [2025-03-03 15:43:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:12,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:12,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:12,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:43:12,522 INFO L87 Difference]: Start difference. First operand 17641 states and 22630 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:43:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:13,484 INFO L93 Difference]: Finished difference Result 26741 states and 33895 transitions. [2025-03-03 15:43:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2025-03-03 15:43:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:13,548 INFO L225 Difference]: With dead ends: 26741 [2025-03-03 15:43:13,548 INFO L226 Difference]: Without dead ends: 15374 [2025-03-03 15:43:13,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:13,570 INFO L435 NwaCegarLoop]: 4071 mSDtfsCounter, 4135 mSDsluCounter, 8096 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 12167 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:13,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 12167 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:43:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15374 states. [2025-03-03 15:43:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15374 to 11386. [2025-03-03 15:43:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11386 states, 10081 states have (on average 1.305525245511358) internal successors, (13161), 10138 states have internal predecessors, (13161), 729 states have call successors, (729), 538 states have call predecessors, (729), 574 states have return successors, (1099), 711 states have call predecessors, (1099), 729 states have call successors, (1099) [2025-03-03 15:43:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 14989 transitions. [2025-03-03 15:43:14,059 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 14989 transitions. Word has length 172 [2025-03-03 15:43:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:14,059 INFO L471 AbstractCegarLoop]: Abstraction has 11386 states and 14989 transitions. [2025-03-03 15:43:14,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:43:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 14989 transitions. [2025-03-03 15:43:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:43:14,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:14,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:14,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:14,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:14,265 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:14,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1184285988, now seen corresponding path program 1 times [2025-03-03 15:43:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:14,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336431115] [2025-03-03 15:43:14,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:14,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:14,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:14,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:14,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:14,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:14,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336431115] [2025-03-03 15:43:14,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336431115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:14,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282700267] [2025-03-03 15:43:14,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:14,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:14,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:14,313 INFO L229 MonitoredProcess]: Starting monitored process 17 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:43:14,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 15:43:14,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:14,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:14,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:14,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:14,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:43:14,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 15:43:14,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282700267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:14,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-03 15:43:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221049038] [2025-03-03 15:43:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:14,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:14,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:14,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:43:14,449 INFO L87 Difference]: Start difference. First operand 11386 states and 14989 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:43:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:14,974 INFO L93 Difference]: Finished difference Result 20633 states and 26105 transitions. [2025-03-03 15:43:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2025-03-03 15:43:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:15,042 INFO L225 Difference]: With dead ends: 20633 [2025-03-03 15:43:15,042 INFO L226 Difference]: Without dead ends: 11386 [2025-03-03 15:43:15,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:15,060 INFO L435 NwaCegarLoop]: 4069 mSDtfsCounter, 4133 mSDsluCounter, 8093 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4142 SdHoareTripleChecker+Valid, 12162 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:15,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4142 Valid, 12162 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:43:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11386 states. [2025-03-03 15:43:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11386 to 11386. [2025-03-03 15:43:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11386 states, 10081 states have (on average 1.2874714810038688) internal successors, (12979), 10138 states have internal predecessors, (12979), 729 states have call successors, (729), 538 states have call predecessors, (729), 574 states have return successors, (1099), 711 states have call predecessors, (1099), 729 states have call successors, (1099) [2025-03-03 15:43:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 14807 transitions. [2025-03-03 15:43:15,552 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 14807 transitions. Word has length 172 [2025-03-03 15:43:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:15,553 INFO L471 AbstractCegarLoop]: Abstraction has 11386 states and 14807 transitions. [2025-03-03 15:43:15,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:43:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 14807 transitions. [2025-03-03 15:43:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:43:15,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:15,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:15,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:15,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-03 15:43:15,759 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:15,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash 891900163, now seen corresponding path program 1 times [2025-03-03 15:43:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:15,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865207064] [2025-03-03 15:43:15,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:15,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:15,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:15,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:15,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865207064] [2025-03-03 15:43:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865207064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478657421] [2025-03-03 15:43:15,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:15,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:15,800 INFO L229 MonitoredProcess]: Starting monitored process 18 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:43:15,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 15:43:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:15,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:15,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:15,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:15,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 15:43:15,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 15:43:15,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478657421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 15:43:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286565968] [2025-03-03 15:43:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:15,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:15,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:43:15,910 INFO L87 Difference]: Start difference. First operand 11386 states and 14807 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:43:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:16,323 INFO L93 Difference]: Finished difference Result 19605 states and 24787 transitions. [2025-03-03 15:43:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:43:16,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 172 [2025-03-03 15:43:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:16,373 INFO L225 Difference]: With dead ends: 19605 [2025-03-03 15:43:16,373 INFO L226 Difference]: Without dead ends: 10356 [2025-03-03 15:43:16,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:43:16,387 INFO L435 NwaCegarLoop]: 4128 mSDtfsCounter, 0 mSDsluCounter, 12378 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16506 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:16,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16506 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2025-03-03 15:43:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 10356. [2025-03-03 15:43:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10356 states, 9203 states have (on average 1.2875149407801805) internal successors, (11849), 9254 states have internal predecessors, (11849), 645 states have call successors, (645), 474 states have call predecessors, (645), 506 states have return successors, (893), 629 states have call predecessors, (893), 645 states have call successors, (893) [2025-03-03 15:43:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10356 states to 10356 states and 13387 transitions. [2025-03-03 15:43:16,815 INFO L78 Accepts]: Start accepts. Automaton has 10356 states and 13387 transitions. Word has length 172 [2025-03-03 15:43:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:16,815 INFO L471 AbstractCegarLoop]: Abstraction has 10356 states and 13387 transitions. [2025-03-03 15:43:16,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:43:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 10356 states and 13387 transitions. [2025-03-03 15:43:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:43:16,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:16,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:16,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 15:43:17,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:17,020 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:17,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -988950654, now seen corresponding path program 1 times [2025-03-03 15:43:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483013881] [2025-03-03 15:43:17,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:17,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:17,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:17,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:17,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483013881] [2025-03-03 15:43:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483013881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339145375] [2025-03-03 15:43:17,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:17,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:17,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:17,065 INFO L229 MonitoredProcess]: Starting monitored process 19 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:43:17,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 15:43:17,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:17,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:17,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:17,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:17,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 15:43:17,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 15:43:17,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:17,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339145375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:17,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:17,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 15:43:17,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337825617] [2025-03-03 15:43:17,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:17,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:17,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:17,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:17,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:43:17,163 INFO L87 Difference]: Start difference. First operand 10356 states and 13387 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:43:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:17,441 INFO L93 Difference]: Finished difference Result 16389 states and 20463 transitions. [2025-03-03 15:43:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:43:17,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 172 [2025-03-03 15:43:17,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:17,484 INFO L225 Difference]: With dead ends: 16389 [2025-03-03 15:43:17,484 INFO L226 Difference]: Without dead ends: 8170 [2025-03-03 15:43:17,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:43:17,496 INFO L435 NwaCegarLoop]: 4128 mSDtfsCounter, 0 mSDsluCounter, 12378 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16506 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:17,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16506 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2025-03-03 15:43:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 8170. [2025-03-03 15:43:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8170 states, 7329 states have (on average 1.3203711283940511) internal successors, (9677), 7368 states have internal predecessors, (9677), 469 states have call successors, (469), 338 states have call predecessors, (469), 370 states have return successors, (583), 465 states have call predecessors, (583), 469 states have call successors, (583) [2025-03-03 15:43:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8170 states to 8170 states and 10729 transitions. [2025-03-03 15:43:17,894 INFO L78 Accepts]: Start accepts. Automaton has 8170 states and 10729 transitions. Word has length 172 [2025-03-03 15:43:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:17,895 INFO L471 AbstractCegarLoop]: Abstraction has 8170 states and 10729 transitions. [2025-03-03 15:43:17,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:43:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8170 states and 10729 transitions. [2025-03-03 15:43:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:43:17,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:17,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:17,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:18,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:18,099 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:18,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash -857393566, now seen corresponding path program 1 times [2025-03-03 15:43:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:18,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473939961] [2025-03-03 15:43:18,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:18,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:18,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:18,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:18,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:18,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:18,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:18,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473939961] [2025-03-03 15:43:18,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473939961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:18,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825898077] [2025-03-03 15:43:18,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:18,153 INFO L229 MonitoredProcess]: Starting monitored process 20 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:43:18,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 15:43:18,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:43:18,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:43:18,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:18,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:18,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 15:43:18,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 15:43:18,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:18,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825898077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:18,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-03 15:43:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658742829] [2025-03-03 15:43:18,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:18,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:18,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:18,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:18,251 INFO L87 Difference]: Start difference. First operand 8170 states and 10729 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:43:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:18,443 INFO L93 Difference]: Finished difference Result 11089 states and 14025 transitions. [2025-03-03 15:43:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:43:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 172 [2025-03-03 15:43:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:18,479 INFO L225 Difference]: With dead ends: 11089 [2025-03-03 15:43:18,479 INFO L226 Difference]: Without dead ends: 3965 [2025-03-03 15:43:18,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:18,488 INFO L435 NwaCegarLoop]: 4128 mSDtfsCounter, 0 mSDsluCounter, 12378 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16506 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:18,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16506 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-03-03 15:43:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3965. [2025-03-03 15:43:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3699 states have (on average 1.5263584752635848) internal successors, (5646), 3711 states have internal predecessors, (5646), 151 states have call successors, (151), 105 states have call predecessors, (151), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2025-03-03 15:43:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5956 transitions. [2025-03-03 15:43:18,626 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5956 transitions. Word has length 172 [2025-03-03 15:43:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:18,626 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 5956 transitions. [2025-03-03 15:43:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 15:43:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5956 transitions. [2025-03-03 15:43:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 15:43:18,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:18,628 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:18,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 15:43:18,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:18,829 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 599711841, now seen corresponding path program 1 times [2025-03-03 15:43:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481089640] [2025-03-03 15:43:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:18,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 15:43:18,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 15:43:18,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:18,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-03 15:43:18,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:18,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481089640] [2025-03-03 15:43:18,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481089640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:18,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:18,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928892045] [2025-03-03 15:43:18,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:18,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:18,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:18,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:18,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:18,922 INFO L87 Difference]: Start difference. First operand 3965 states and 5956 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:43:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:19,178 INFO L93 Difference]: Finished difference Result 3965 states and 5956 transitions. [2025-03-03 15:43:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:43:19,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 211 [2025-03-03 15:43:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:19,212 INFO L225 Difference]: With dead ends: 3965 [2025-03-03 15:43:19,212 INFO L226 Difference]: Without dead ends: 2123 [2025-03-03 15:43:19,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:19,215 INFO L435 NwaCegarLoop]: 4327 mSDtfsCounter, 4293 mSDsluCounter, 8512 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4293 SdHoareTripleChecker+Valid, 12839 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:19,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4293 Valid, 12839 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:43:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2025-03-03 15:43:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123. [2025-03-03 15:43:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2122 states have (on average 1.8656927426955703) internal successors, (3959), 2122 states have internal predecessors, (3959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 3959 transitions. [2025-03-03 15:43:19,268 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 3959 transitions. Word has length 211 [2025-03-03 15:43:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 3959 transitions. [2025-03-03 15:43:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:43:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3959 transitions. [2025-03-03 15:43:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1677 [2025-03-03 15:43:19,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:19,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:19,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:43:19,284 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:19,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1990627430, now seen corresponding path program 1 times [2025-03-03 15:43:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:19,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137969070] [2025-03-03 15:43:19,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:19,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1676 statements into 1 equivalence classes. [2025-03-03 15:43:19,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1676 of 1676 statements. [2025-03-03 15:43:19,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:19,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:21,445 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:43:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137969070] [2025-03-03 15:43:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137969070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:21,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:43:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891111769] [2025-03-03 15:43:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:21,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:43:21,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:21,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:43:21,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:43:21,448 INFO L87 Difference]: Start difference. First operand 2123 states and 3959 transitions. Second operand has 4 states, 4 states have (on average 419.0) internal successors, (1676), 3 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:30,905 INFO L93 Difference]: Finished difference Result 9399 states and 17961 transitions. [2025-03-03 15:43:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:43:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 419.0) internal successors, (1676), 3 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1676 [2025-03-03 15:43:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:30,939 INFO L225 Difference]: With dead ends: 9399 [2025-03-03 15:43:30,939 INFO L226 Difference]: Without dead ends: 7279 [2025-03-03 15:43:30,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:30,941 INFO L435 NwaCegarLoop]: 1167 mSDtfsCounter, 4207 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 10332 mSolverCounterSat, 5676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4207 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 16008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5676 IncrementalHoareTripleChecker+Valid, 10332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:30,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4207 Valid, 1612 Invalid, 16008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5676 Valid, 10332 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-03-03 15:43:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7279 states. [2025-03-03 15:43:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7279 to 5607. [2025-03-03 15:43:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5607 states, 5606 states have (on average 1.527827327863004) internal successors, (8565), 5606 states have internal predecessors, (8565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5607 states to 5607 states and 8565 transitions. [2025-03-03 15:43:31,010 INFO L78 Accepts]: Start accepts. Automaton has 5607 states and 8565 transitions. Word has length 1676 [2025-03-03 15:43:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 5607 states and 8565 transitions. [2025-03-03 15:43:31,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 419.0) internal successors, (1676), 3 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5607 states and 8565 transitions. [2025-03-03 15:43:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1797 [2025-03-03 15:43:31,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:31,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:43:31,029 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash -318713492, now seen corresponding path program 1 times [2025-03-03 15:43:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302015730] [2025-03-03 15:43:31,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:31,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1796 statements into 1 equivalence classes. [2025-03-03 15:43:31,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1796 of 1796 statements. [2025-03-03 15:43:31,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:31,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:43:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302015730] [2025-03-03 15:43:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302015730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:31,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 15:43:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87903072] [2025-03-03 15:43:31,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:31,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:31,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:31,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:43:31,777 INFO L87 Difference]: Start difference. First operand 5607 states and 8565 transitions. Second operand has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 2 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:35,457 INFO L93 Difference]: Finished difference Result 14659 states and 21710 transitions. [2025-03-03 15:43:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 2 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1796 [2025-03-03 15:43:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:35,493 INFO L225 Difference]: With dead ends: 14659 [2025-03-03 15:43:35,493 INFO L226 Difference]: Without dead ends: 9055 [2025-03-03 15:43:35,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:43:35,499 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 1849 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 5542 mSolverCounterSat, 899 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 6441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 899 IncrementalHoareTripleChecker+Valid, 5542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:35,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 2000 Invalid, 6441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [899 Valid, 5542 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 15:43:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9055 states. [2025-03-03 15:43:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9055 to 7349. [2025-03-03 15:43:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7349 states, 7348 states have (on average 1.4820359281437125) internal successors, (10890), 7348 states have internal predecessors, (10890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7349 states to 7349 states and 10890 transitions. [2025-03-03 15:43:35,582 INFO L78 Accepts]: Start accepts. Automaton has 7349 states and 10890 transitions. Word has length 1796 [2025-03-03 15:43:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:35,582 INFO L471 AbstractCegarLoop]: Abstraction has 7349 states and 10890 transitions. [2025-03-03 15:43:35,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 2 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7349 states and 10890 transitions. [2025-03-03 15:43:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1802 [2025-03-03 15:43:35,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:35,599 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:43:35,600 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:35,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -817855296, now seen corresponding path program 1 times [2025-03-03 15:43:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481543539] [2025-03-03 15:43:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:35,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1801 statements into 1 equivalence classes. [2025-03-03 15:43:35,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1801 of 1801 statements. [2025-03-03 15:43:35,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:43:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481543539] [2025-03-03 15:43:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481543539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:43:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970184109] [2025-03-03 15:43:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:36,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:36,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:43:36,500 INFO L87 Difference]: Start difference. First operand 7349 states and 10890 transitions. Second operand has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:40,839 INFO L93 Difference]: Finished difference Result 19820 states and 30256 transitions. [2025-03-03 15:43:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1801 [2025-03-03 15:43:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:40,886 INFO L225 Difference]: With dead ends: 19820 [2025-03-03 15:43:40,886 INFO L226 Difference]: Without dead ends: 12474 [2025-03-03 15:43:40,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:43:40,896 INFO L435 NwaCegarLoop]: 3826 mSDtfsCounter, 1799 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 5693 mSolverCounterSat, 1482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 4092 SdHoareTripleChecker+Invalid, 7175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1482 IncrementalHoareTripleChecker+Valid, 5693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:40,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1799 Valid, 4092 Invalid, 7175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1482 Valid, 5693 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 15:43:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12474 states. [2025-03-03 15:43:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12474 to 12457. [2025-03-03 15:43:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12457 states, 12456 states have (on average 1.3501123956326269) internal successors, (16817), 12456 states have internal predecessors, (16817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12457 states to 12457 states and 16817 transitions. [2025-03-03 15:43:41,020 INFO L78 Accepts]: Start accepts. Automaton has 12457 states and 16817 transitions. Word has length 1801 [2025-03-03 15:43:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:41,020 INFO L471 AbstractCegarLoop]: Abstraction has 12457 states and 16817 transitions. [2025-03-03 15:43:41,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:43:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 12457 states and 16817 transitions. [2025-03-03 15:43:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1804 [2025-03-03 15:43:41,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:41,042 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:43:41,043 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:41,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1250974693, now seen corresponding path program 1 times [2025-03-03 15:43:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441704215] [2025-03-03 15:43:41,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:41,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1803 statements into 1 equivalence classes. [2025-03-03 15:43:41,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1803 of 1803 statements. [2025-03-03 15:43:41,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:41,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat