./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dda75b6d46698b5258f612b82d0e93d324481eaa047be7e62672a619c582b4e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:44:37,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:44:37,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:44:37,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:44:37,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:44:37,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:44:37,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:44:37,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:44:37,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:44:37,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:44:37,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:44:37,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:44:37,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:44:37,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:44:37,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:44:37,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:44:37,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:44:37,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:44:37,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:44:37,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:44:37,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:44:37,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:44:37,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:44:37,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:44:37,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:44:37,135 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 -> 2dda75b6d46698b5258f612b82d0e93d324481eaa047be7e62672a619c582b4e [2025-03-03 15:44:37,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:44:37,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:44:37,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:44:37,385 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:44:37,386 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:44:37,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-2.c [2025-03-03 15:44:38,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa6a3d9f/40eb280e07154a02b1df88021026a5da/FLAGe7f12c90f [2025-03-03 15:44:39,214 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:44:39,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-2.c [2025-03-03 15:44:39,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa6a3d9f/40eb280e07154a02b1df88021026a5da/FLAGe7f12c90f [2025-03-03 15:44:39,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa6a3d9f/40eb280e07154a02b1df88021026a5da [2025-03-03 15:44:39,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:44:39,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:44:39,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:44:39,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:44:39,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:44:39,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:44:39" (1/1) ... [2025-03-03 15:44:39,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45544436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:39, skipping insertion in model container [2025-03-03 15:44:39,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:44:39" (1/1) ... [2025-03-03 15:44:39,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:44:40,892 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_label46+token_ring.06.cil-2.c[382357,382370] [2025-03-03 15:44:40,918 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_label46+token_ring.06.cil-2.c[383339,383352] [2025-03-03 15:44:41,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:44:41,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:44:41,627 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_label46+token_ring.06.cil-2.c[382357,382370] [2025-03-03 15:44:41,629 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_label46+token_ring.06.cil-2.c[383339,383352] [2025-03-03 15:44:41,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:44:41,687 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:44:41,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41 WrapperNode [2025-03-03 15:44:41,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:44:41,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:44:41,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:44:41,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:44:41,695 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:44:41" (1/1) ... [2025-03-03 15:44:41,765 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:44:41" (1/1) ... [2025-03-03 15:44:42,030 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12843 [2025-03-03 15:44:42,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:44:42,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:44:42,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:44:42,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:44:42,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,223 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:44:42,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:44:42,600 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:44:42,601 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:44:42,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:44:42,602 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (1/1) ... [2025-03-03 15:44:42,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:44:42,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:42,634 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:44:42,638 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:44:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:44:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:44:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:44:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:44:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:44:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:44:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:44:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:44:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:44:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:44:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:44:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:44:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:44:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:44:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:44:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:44:42,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:44:42,750 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:44:48,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:44:48,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:44:48,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:44:48,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:44:48,909 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:44:48,909 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:44:48,909 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:44:49,143 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2025-03-03 15:44:49,144 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:44:49,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:44:49,199 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:44:49,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:44:49 BoogieIcfgContainer [2025-03-03 15:44:49,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:44:49,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:44:49,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:44:49,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:44:49,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:44:39" (1/3) ... [2025-03-03 15:44:49,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4824bbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:44:49, skipping insertion in model container [2025-03-03 15:44:49,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:41" (2/3) ... [2025-03-03 15:44:49,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4824bbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:44:49, skipping insertion in model container [2025-03-03 15:44:49,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:44:49" (3/3) ... [2025-03-03 15:44:49,210 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.06.cil-2.c [2025-03-03 15:44:49,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:44:49,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.06.cil-2.c that has 7 procedures, 2429 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-03 15:44:49,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:44:49,330 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;@44fbea30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:44:49,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:44:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 2429 states, 2400 states have (on average 1.8420833333333333) internal successors, (4421), 2403 states have internal predecessors, (4421), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 15:44:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:49,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:49,352 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] [2025-03-03 15:44:49,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:49,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1873398505, now seen corresponding path program 1 times [2025-03-03 15:44:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237687454] [2025-03-03 15:44:49,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:49,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:49,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:49,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:49,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:49,855 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:44:49,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:49,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237687454] [2025-03-03 15:44:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237687454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:49,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:49,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:44:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567955014] [2025-03-03 15:44:49,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:49,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:44:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:49,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:44:49,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:44:49,886 INFO L87 Difference]: Start difference. First operand has 2429 states, 2400 states have (on average 1.8420833333333333) internal successors, (4421), 2403 states have internal predecessors, (4421), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:44:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:50,458 INFO L93 Difference]: Finished difference Result 5098 states and 9301 transitions. [2025-03-03 15:44:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:44:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:50,489 INFO L225 Difference]: With dead ends: 5098 [2025-03-03 15:44:50,491 INFO L226 Difference]: Without dead ends: 2613 [2025-03-03 15:44:50,502 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:44:50,505 INFO L435 NwaCegarLoop]: 4312 mSDtfsCounter, 4680 mSDsluCounter, 8779 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4694 SdHoareTripleChecker+Valid, 13091 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:50,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4694 Valid, 13091 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:44:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2025-03-03 15:44:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2596. [2025-03-03 15:44:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2546 states have (on average 1.8087195600942656) internal successors, (4605), 2549 states have internal predecessors, (4605), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-03 15:44:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 4676 transitions. [2025-03-03 15:44:50,649 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 4676 transitions. Word has length 112 [2025-03-03 15:44:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:50,649 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 4676 transitions. [2025-03-03 15:44:50,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:44:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 4676 transitions. [2025-03-03 15:44:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:50,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:50,655 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] [2025-03-03 15:44:50,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:44:50,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:50,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash 365414187, now seen corresponding path program 1 times [2025-03-03 15:44:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124192544] [2025-03-03 15:44:50,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:50,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:50,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:50,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:50,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124192544] [2025-03-03 15:44:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124192544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:50,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:50,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:44:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192325254] [2025-03-03 15:44:50,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:50,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:44:50,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:50,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:44:50,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:44:50,863 INFO L87 Difference]: Start difference. First operand 2596 states and 4676 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:44:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:51,217 INFO L93 Difference]: Finished difference Result 3099 states and 5453 transitions. [2025-03-03 15:44:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:44:51,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:51,228 INFO L225 Difference]: With dead ends: 3099 [2025-03-03 15:44:51,229 INFO L226 Difference]: Without dead ends: 2638 [2025-03-03 15:44:51,231 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:44:51,233 INFO L435 NwaCegarLoop]: 4231 mSDtfsCounter, 4431 mSDsluCounter, 8367 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4445 SdHoareTripleChecker+Valid, 12598 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:51,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4445 Valid, 12598 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:44:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2025-03-03 15:44:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2596. [2025-03-03 15:44:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2546 states have (on average 1.8079340141398272) internal successors, (4603), 2549 states have internal predecessors, (4603), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-03 15:44:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 4674 transitions. [2025-03-03 15:44:51,318 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 4674 transitions. Word has length 112 [2025-03-03 15:44:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 4674 transitions. [2025-03-03 15:44:51,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:44:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 4674 transitions. [2025-03-03 15:44:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:51,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:51,323 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] [2025-03-03 15:44:51,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:44:51,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -444073270, now seen corresponding path program 1 times [2025-03-03 15:44:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450276058] [2025-03-03 15:44:51,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:51,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:51,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:51,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:51,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:51,498 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:44:51,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:51,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450276058] [2025-03-03 15:44:51,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450276058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:51,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:51,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:51,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457043928] [2025-03-03 15:44:51,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:51,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:51,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:51,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:51,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:51,502 INFO L87 Difference]: Start difference. First operand 2596 states and 4674 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:51,997 INFO L93 Difference]: Finished difference Result 3344 states and 5818 transitions. [2025-03-03 15:44:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:52,011 INFO L225 Difference]: With dead ends: 3344 [2025-03-03 15:44:52,012 INFO L226 Difference]: Without dead ends: 2883 [2025-03-03 15:44:52,014 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:44:52,015 INFO L435 NwaCegarLoop]: 4430 mSDtfsCounter, 4603 mSDsluCounter, 13307 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4617 SdHoareTripleChecker+Valid, 17737 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:52,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4617 Valid, 17737 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:44:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2025-03-03 15:44:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2814. [2025-03-03 15:44:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2742 states have (on average 1.7848285922684173) internal successors, (4894), 2746 states have internal predecessors, (4894), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-03 15:44:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 4998 transitions. [2025-03-03 15:44:52,098 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 4998 transitions. Word has length 112 [2025-03-03 15:44:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:52,098 INFO L471 AbstractCegarLoop]: Abstraction has 2814 states and 4998 transitions. [2025-03-03 15:44:52,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 4998 transitions. [2025-03-03 15:44:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:52,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:52,100 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] [2025-03-03 15:44:52,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:44:52,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:52,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash -885827765, now seen corresponding path program 1 times [2025-03-03 15:44:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331882516] [2025-03-03 15:44:52,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:52,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:52,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:52,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:52,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:52,259 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:44:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:52,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331882516] [2025-03-03 15:44:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331882516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:52,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19383636] [2025-03-03 15:44:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:52,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:52,264 INFO L87 Difference]: Start difference. First operand 2814 states and 4998 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:53,150 INFO L93 Difference]: Finished difference Result 4029 states and 6851 transitions. [2025-03-03 15:44:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:53,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:53,169 INFO L225 Difference]: With dead ends: 4029 [2025-03-03 15:44:53,169 INFO L226 Difference]: Without dead ends: 3350 [2025-03-03 15:44:53,173 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:44:53,173 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4598 mSDsluCounter, 13295 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4612 SdHoareTripleChecker+Valid, 17721 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:53,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4612 Valid, 17721 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:44:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2025-03-03 15:44:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3273. [2025-03-03 15:44:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 3155 states have (on average 1.7480190174326466) internal successors, (5515), 3163 states have internal predecessors, (5515), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-03 15:44:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 5691 transitions. [2025-03-03 15:44:53,293 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 5691 transitions. Word has length 112 [2025-03-03 15:44:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:53,294 INFO L471 AbstractCegarLoop]: Abstraction has 3273 states and 5691 transitions. [2025-03-03 15:44:53,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 5691 transitions. [2025-03-03 15:44:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:53,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:53,295 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] [2025-03-03 15:44:53,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:44:53,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -900077910, now seen corresponding path program 1 times [2025-03-03 15:44:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330864639] [2025-03-03 15:44:53,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:53,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:53,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:53,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:53,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:53,397 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:44:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330864639] [2025-03-03 15:44:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330864639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:53,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008093678] [2025-03-03 15:44:53,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:53,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:53,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:53,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:53,399 INFO L87 Difference]: Start difference. First operand 3273 states and 5691 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:53,896 INFO L93 Difference]: Finished difference Result 5486 states and 9094 transitions. [2025-03-03 15:44:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:53,915 INFO L225 Difference]: With dead ends: 5486 [2025-03-03 15:44:53,915 INFO L226 Difference]: Without dead ends: 4348 [2025-03-03 15:44:53,920 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:44:53,921 INFO L435 NwaCegarLoop]: 4423 mSDtfsCounter, 4593 mSDsluCounter, 13286 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4607 SdHoareTripleChecker+Valid, 17709 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:53,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4607 Valid, 17709 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:44:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2025-03-03 15:44:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 4254. [2025-03-03 15:44:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4038 states have (on average 1.6996037642397226) internal successors, (6863), 4060 states have internal predecessors, (6863), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-03 15:44:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 7207 transitions. [2025-03-03 15:44:54,117 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 7207 transitions. Word has length 112 [2025-03-03 15:44:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:54,117 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 7207 transitions. [2025-03-03 15:44:54,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 7207 transitions. [2025-03-03 15:44:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:54,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:54,125 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] [2025-03-03 15:44:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:44:54,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1870368917, now seen corresponding path program 1 times [2025-03-03 15:44:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319363191] [2025-03-03 15:44:54,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:54,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:54,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:54,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:54,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:54,236 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:44:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319363191] [2025-03-03 15:44:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319363191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:54,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:54,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721446740] [2025-03-03 15:44:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:54,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:54,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:54,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:54,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:54,239 INFO L87 Difference]: Start difference. First operand 4254 states and 7207 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:54,718 INFO L93 Difference]: Finished difference Result 8633 states and 14088 transitions. [2025-03-03 15:44:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:54,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:54,756 INFO L225 Difference]: With dead ends: 8633 [2025-03-03 15:44:54,757 INFO L226 Difference]: Without dead ends: 6514 [2025-03-03 15:44:54,765 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:44:54,766 INFO L435 NwaCegarLoop]: 4253 mSDtfsCounter, 4612 mSDsluCounter, 12879 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4626 SdHoareTripleChecker+Valid, 17132 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:54,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4626 Valid, 17132 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:44:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2025-03-03 15:44:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6387. [2025-03-03 15:44:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6387 states, 5957 states have (on average 1.6523417827765654) internal successors, (9843), 6025 states have internal predecessors, (9843), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-03 15:44:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6387 states to 6387 states and 10619 transitions. [2025-03-03 15:44:55,080 INFO L78 Accepts]: Start accepts. Automaton has 6387 states and 10619 transitions. Word has length 112 [2025-03-03 15:44:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:55,080 INFO L471 AbstractCegarLoop]: Abstraction has 6387 states and 10619 transitions. [2025-03-03 15:44:55,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6387 states and 10619 transitions. [2025-03-03 15:44:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:55,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:55,084 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] [2025-03-03 15:44:55,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:44:55,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:55,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -931837302, now seen corresponding path program 1 times [2025-03-03 15:44:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50781016] [2025-03-03 15:44:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:55,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:55,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:55,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:55,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:55,168 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:44:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50781016] [2025-03-03 15:44:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50781016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:55,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165599099] [2025-03-03 15:44:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:55,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:55,170 INFO L87 Difference]: Start difference. First operand 6387 states and 10619 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:55,751 INFO L93 Difference]: Finished difference Result 15552 states and 25578 transitions. [2025-03-03 15:44:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:55,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:55,835 INFO L225 Difference]: With dead ends: 15552 [2025-03-03 15:44:55,839 INFO L226 Difference]: Without dead ends: 11300 [2025-03-03 15:44:55,853 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:44:55,854 INFO L435 NwaCegarLoop]: 4417 mSDtfsCounter, 4583 mSDsluCounter, 13268 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4597 SdHoareTripleChecker+Valid, 17685 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:55,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4597 Valid, 17685 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:44:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2025-03-03 15:44:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 11112. [2025-03-03 15:44:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11112 states, 10200 states have (on average 1.6226470588235293) internal successors, (16551), 10414 states have internal predecessors, (16551), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-03 15:44:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 18575 transitions. [2025-03-03 15:44:56,321 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 18575 transitions. Word has length 112 [2025-03-03 15:44:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:56,321 INFO L471 AbstractCegarLoop]: Abstraction has 11112 states and 18575 transitions. [2025-03-03 15:44:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 18575 transitions. [2025-03-03 15:44:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:56,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:56,326 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] [2025-03-03 15:44:56,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:44:56,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:56,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1317204085, now seen corresponding path program 1 times [2025-03-03 15:44:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:56,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373606236] [2025-03-03 15:44:56,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:56,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:56,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:56,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:56,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:56,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:56,466 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:44:56,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:56,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373606236] [2025-03-03 15:44:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373606236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:56,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:56,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896774283] [2025-03-03 15:44:56,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:56,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:56,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:56,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:56,468 INFO L87 Difference]: Start difference. First operand 11112 states and 18575 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:57,327 INFO L93 Difference]: Finished difference Result 32555 states and 55401 transitions. [2025-03-03 15:44:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:57,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:57,405 INFO L225 Difference]: With dead ends: 32555 [2025-03-03 15:44:57,406 INFO L226 Difference]: Without dead ends: 23578 [2025-03-03 15:44:57,436 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:44:57,436 INFO L435 NwaCegarLoop]: 4412 mSDtfsCounter, 4772 mSDsluCounter, 13248 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 17660 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:57,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 17660 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:44:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23578 states. [2025-03-03 15:44:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23578 to 21681. [2025-03-03 15:44:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21681 states, 19675 states have (on average 1.6178398983481577) internal successors, (31831), 20343 states have internal predecessors, (31831), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-03 15:44:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21681 states to 21681 states and 37823 transitions. [2025-03-03 15:44:58,660 INFO L78 Accepts]: Start accepts. Automaton has 21681 states and 37823 transitions. Word has length 112 [2025-03-03 15:44:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:58,660 INFO L471 AbstractCegarLoop]: Abstraction has 21681 states and 37823 transitions. [2025-03-03 15:44:58,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:44:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21681 states and 37823 transitions. [2025-03-03 15:44:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:44:58,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:58,670 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] [2025-03-03 15:44:58,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:44:58,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:58,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash 332932714, now seen corresponding path program 1 times [2025-03-03 15:44:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976053099] [2025-03-03 15:44:58,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:58,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:44:58,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:44:58,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:58,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:58,744 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:44:58,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:58,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976053099] [2025-03-03 15:44:58,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976053099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:58,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:58,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:44:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106109601] [2025-03-03 15:44:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:44:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:58,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:44:58,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:44:58,746 INFO L87 Difference]: Start difference. First operand 21681 states and 37823 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:44:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:59,568 INFO L93 Difference]: Finished difference Result 46344 states and 83934 transitions. [2025-03-03 15:44:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:44:59,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:44:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:59,791 INFO L225 Difference]: With dead ends: 46344 [2025-03-03 15:44:59,792 INFO L226 Difference]: Without dead ends: 26798 [2025-03-03 15:44:59,836 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:44:59,840 INFO L435 NwaCegarLoop]: 4216 mSDtfsCounter, 4420 mSDsluCounter, 8336 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 12552 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:59,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 12552 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:44:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26798 states. [2025-03-03 15:45:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26798 to 21681. [2025-03-03 15:45:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21681 states, 19675 states have (on average 1.6145362134688692) internal successors, (31766), 20343 states have internal predecessors, (31766), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-03 15:45:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21681 states to 21681 states and 37758 transitions. [2025-03-03 15:45:00,857 INFO L78 Accepts]: Start accepts. Automaton has 21681 states and 37758 transitions. Word has length 112 [2025-03-03 15:45:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:00,861 INFO L471 AbstractCegarLoop]: Abstraction has 21681 states and 37758 transitions. [2025-03-03 15:45:00,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:45:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 21681 states and 37758 transitions. [2025-03-03 15:45:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:45:00,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:00,881 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] [2025-03-03 15:45:00,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:45:00,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:00,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2107689045, now seen corresponding path program 1 times [2025-03-03 15:45:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:00,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278077434] [2025-03-03 15:45:00,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:00,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:45:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:45:00,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:00,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:01,056 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:45:01,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:01,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278077434] [2025-03-03 15:45:01,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278077434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:01,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:01,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:01,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669379515] [2025-03-03 15:45:01,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:01,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:01,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:01,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:01,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:01,059 INFO L87 Difference]: Start difference. First operand 21681 states and 37758 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:45:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:03,020 INFO L93 Difference]: Finished difference Result 67422 states and 123668 transitions. [2025-03-03 15:45:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:03,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:45:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:03,241 INFO L225 Difference]: With dead ends: 67422 [2025-03-03 15:45:03,242 INFO L226 Difference]: Without dead ends: 47876 [2025-03-03 15:45:03,299 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:45:03,300 INFO L435 NwaCegarLoop]: 4404 mSDtfsCounter, 4699 mSDsluCounter, 13225 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 17629 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:03,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 17629 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:45:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47876 states. [2025-03-03 15:45:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47876 to 45153. [2025-03-03 15:45:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45153 states, 40505 states have (on average 1.6187631156647329) internal successors, (65568), 42567 states have internal predecessors, (65568), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-03 15:45:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45153 states to 45153 states and 85576 transitions. [2025-03-03 15:45:05,566 INFO L78 Accepts]: Start accepts. Automaton has 45153 states and 85576 transitions. Word has length 112 [2025-03-03 15:45:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:05,567 INFO L471 AbstractCegarLoop]: Abstraction has 45153 states and 85576 transitions. [2025-03-03 15:45:05,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:45:05,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45153 states and 85576 transitions. [2025-03-03 15:45:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:45:05,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:05,584 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] [2025-03-03 15:45:05,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:45:05,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:05,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash -939492790, now seen corresponding path program 1 times [2025-03-03 15:45:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431988203] [2025-03-03 15:45:05,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:45:05,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:45:05,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:05,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:05,668 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:45:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431988203] [2025-03-03 15:45:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431988203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:05,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633002784] [2025-03-03 15:45:05,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:05,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:05,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:05,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:05,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:05,670 INFO L87 Difference]: Start difference. First operand 45153 states and 85576 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:45:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:08,146 INFO L93 Difference]: Finished difference Result 99116 states and 199138 transitions. [2025-03-03 15:45:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:45:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:08,386 INFO L225 Difference]: With dead ends: 99116 [2025-03-03 15:45:08,386 INFO L226 Difference]: Without dead ends: 56098 [2025-03-03 15:45:08,492 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:45:08,493 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 4416 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 12538 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:08,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 12538 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:45:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56098 states. [2025-03-03 15:45:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56098 to 45153. [2025-03-03 15:45:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45153 states, 40505 states have (on average 1.6155783236637453) internal successors, (65439), 42567 states have internal predecessors, (65439), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-03 15:45:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45153 states to 45153 states and 85447 transitions. [2025-03-03 15:45:10,982 INFO L78 Accepts]: Start accepts. Automaton has 45153 states and 85447 transitions. Word has length 112 [2025-03-03 15:45:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:10,982 INFO L471 AbstractCegarLoop]: Abstraction has 45153 states and 85447 transitions. [2025-03-03 15:45:10,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:45:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 45153 states and 85447 transitions. [2025-03-03 15:45:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:45:10,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:10,996 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] [2025-03-03 15:45:10,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:45:10,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:10,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2146232267, now seen corresponding path program 1 times [2025-03-03 15:45:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:10,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192256233] [2025-03-03 15:45:10,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:10,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:11,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:45:11,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:45:11,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:11,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:11,057 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:45:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:11,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192256233] [2025-03-03 15:45:11,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192256233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:11,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:11,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:11,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910871711] [2025-03-03 15:45:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:11,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:11,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:11,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:11,059 INFO L87 Difference]: Start difference. First operand 45153 states and 85447 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:45:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:13,746 INFO L93 Difference]: Finished difference Result 96927 states and 194502 transitions. [2025-03-03 15:45:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:45:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:13,969 INFO L225 Difference]: With dead ends: 96927 [2025-03-03 15:45:13,969 INFO L226 Difference]: Without dead ends: 53909 [2025-03-03 15:45:14,065 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:45:14,065 INFO L435 NwaCegarLoop]: 4208 mSDtfsCounter, 4413 mSDsluCounter, 8322 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 12530 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:14,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 12530 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:45:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53909 states. [2025-03-03 15:45:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53909 to 45153. [2025-03-03 15:45:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45153 states, 40505 states have (on average 1.6123935316627578) internal successors, (65310), 42567 states have internal predecessors, (65310), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-03 15:45:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45153 states to 45153 states and 85318 transitions. [2025-03-03 15:45:16,659 INFO L78 Accepts]: Start accepts. Automaton has 45153 states and 85318 transitions. Word has length 112 [2025-03-03 15:45:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:16,659 INFO L471 AbstractCegarLoop]: Abstraction has 45153 states and 85318 transitions. [2025-03-03 15:45:16,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:45:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 45153 states and 85318 transitions. [2025-03-03 15:45:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:45:16,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:16,674 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] [2025-03-03 15:45:16,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:45:16,674 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:16,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash -940816854, now seen corresponding path program 1 times [2025-03-03 15:45:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:16,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458190056] [2025-03-03 15:45:16,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:16,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:45:16,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:45:16,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:16,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:16,765 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:45:16,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:16,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458190056] [2025-03-03 15:45:16,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458190056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:16,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:16,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578499452] [2025-03-03 15:45:16,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:16,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:16,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:16,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:16,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:16,767 INFO L87 Difference]: Start difference. First operand 45153 states and 85318 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:45:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:21,239 INFO L93 Difference]: Finished difference Result 139440 states and 290170 transitions. [2025-03-03 15:45:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-03-03 15:45:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:21,693 INFO L225 Difference]: With dead ends: 139440 [2025-03-03 15:45:21,694 INFO L226 Difference]: Without dead ends: 96422 [2025-03-03 15:45:21,822 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:45:21,822 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4588 mSDsluCounter, 13188 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4609 SdHoareTripleChecker+Valid, 17579 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:21,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4609 Valid, 17579 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:45:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96422 states. [2025-03-03 15:45:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96422 to 94092. [2025-03-03 15:45:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94092 states, 82766 states have (on average 1.6004881231423531) internal successors, (132466), 89074 states have internal predecessors, (132466), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-03-03 15:45:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94092 states to 94092 states and 204954 transitions. [2025-03-03 15:45:28,753 INFO L78 Accepts]: Start accepts. Automaton has 94092 states and 204954 transitions. Word has length 112 [2025-03-03 15:45:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:28,753 INFO L471 AbstractCegarLoop]: Abstraction has 94092 states and 204954 transitions. [2025-03-03 15:45:28,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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:45:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 94092 states and 204954 transitions. [2025-03-03 15:45:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:45:28,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:28,779 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] [2025-03-03 15:45:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:45:28,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1869094891, now seen corresponding path program 1 times [2025-03-03 15:45:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867054104] [2025-03-03 15:45:28,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:28,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:45:28,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:45:28,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:28,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:28,841 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:45:28,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:28,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867054104] [2025-03-03 15:45:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867054104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:28,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74877025] [2025-03-03 15:45:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:28,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:28,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:28,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:28,843 INFO L87 Difference]: Start difference. First operand 94092 states and 204954 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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)