./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label42+token_ring.11.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 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:57:53,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:57:53,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:57:53,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:57:53,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:57:53,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:57:53,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:57:53,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:57:53,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:57:53,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:57:53,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:57:53,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:57:53,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:57:53,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:57:53,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:57:53,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:57:53,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:57:53,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:57:53,740 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 -> 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d [2025-03-16 19:57:53,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:57:53,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:57:53,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:57:53,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:57:53,974 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:57:53,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c [2025-03-16 19:57:55,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539c2bc8f/94e33342023a49208e0f5b8a344fe69f/FLAG51b8764d6 [2025-03-16 19:57:55,700 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:57:55,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c [2025-03-16 19:57:55,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539c2bc8f/94e33342023a49208e0f5b8a344fe69f/FLAG51b8764d6 [2025-03-16 19:57:56,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539c2bc8f/94e33342023a49208e0f5b8a344fe69f [2025-03-16 19:57:56,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:57:56,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:57:56,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:57:56,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:57:56,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:57:56,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:57:56" (1/1) ... [2025-03-16 19:57:56,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df9a936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:56, skipping insertion in model container [2025-03-16 19:57:56,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:57:56" (1/1) ... [2025-03-16 19:57:56,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:57:57,427 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_label42+token_ring.11.cil-2.c[378560,378573] [2025-03-16 19:57:57,454 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_label42+token_ring.11.cil-2.c[383339,383352] [2025-03-16 19:57:57,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:57,682 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:57:58,178 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_label42+token_ring.11.cil-2.c[378560,378573] [2025-03-16 19:57:58,184 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_label42+token_ring.11.cil-2.c[383339,383352] [2025-03-16 19:57:58,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:58,250 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:57:58,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58 WrapperNode [2025-03-16 19:57:58,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:57:58,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:58,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:57:58,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:57:58,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,714 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-03-16 19:57:58,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:58,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:57:58,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:57:58,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:57:58,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,864 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-16 19:57:58,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:58,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:59,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:59,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:59,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:57:59,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:57:59,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:57:59,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:57:59,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (1/1) ... [2025-03-16 19:57:59,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:57:59,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:59,097 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-16 19:57:59,102 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-16 19:57:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:57:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:57:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:57:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:57:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:57:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:57:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:57:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:57:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:57:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:57:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:57:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:57:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:57:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:57:59,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:57:59,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:57:59,227 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:57:59,228 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:58:04,958 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:58:04,959 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:58:04,959 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:58:04,959 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:58:04,960 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:58:04,960 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:58:04,960 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:58:05,251 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2025-03-16 19:58:05,253 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:58:05,320 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:58:05,320 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:58:05,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:58:05 BoogieIcfgContainer [2025-03-16 19:58:05,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:58:05,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:58:05,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:58:05,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:58:05,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:57:56" (1/3) ... [2025-03-16 19:58:05,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8a958a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:58:05, skipping insertion in model container [2025-03-16 19:58:05,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:58" (2/3) ... [2025-03-16 19:58:05,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8a958a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:58:05, skipping insertion in model container [2025-03-16 19:58:05,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:58:05" (3/3) ... [2025-03-16 19:58:05,331 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.11.cil-2.c [2025-03-16 19:58:05,345 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:58:05,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.11.cil-2.c that has 7 procedures, 2460 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-16 19:58:05,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:58:05,459 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;@2354f214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:58:05,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:58:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 2460 states, 2427 states have (on average 1.8652657601977751) internal successors, (4527), 2429 states have internal predecessors, (4527), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-16 19:58:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:05,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:05,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:05,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:05,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1933840795, now seen corresponding path program 1 times [2025-03-16 19:58:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733955964] [2025-03-16 19:58:05,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:05,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:05,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:05,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:05,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:05,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:06,050 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-16 19:58:06,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733955964] [2025-03-16 19:58:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733955964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:06,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:06,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:06,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127398333] [2025-03-16 19:58:06,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:06,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:06,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:06,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:06,076 INFO L87 Difference]: Start difference. First operand has 2460 states, 2427 states have (on average 1.8652657601977751) internal successors, (4527), 2429 states have internal predecessors, (4527), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-16 19:58:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:06,759 INFO L93 Difference]: Finished difference Result 5268 states and 9736 transitions. [2025-03-16 19:58:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:58:06,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:06,790 INFO L225 Difference]: With dead ends: 5268 [2025-03-16 19:58:06,791 INFO L226 Difference]: Without dead ends: 2817 [2025-03-16 19:58:06,802 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-16 19:58:06,804 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4991 mSDsluCounter, 9014 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 13403 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:06,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5010 Valid, 13403 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:58:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-03-16 19:58:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2790. [2025-03-16 19:58:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2730 states have (on average 1.810989010989011) internal successors, (4944), 2733 states have internal predecessors, (4944), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-16 19:58:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 5035 transitions. [2025-03-16 19:58:06,964 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 5035 transitions. Word has length 151 [2025-03-16 19:58:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:06,964 INFO L471 AbstractCegarLoop]: Abstraction has 2790 states and 5035 transitions. [2025-03-16 19:58:06,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 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-16 19:58:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 5035 transitions. [2025-03-16 19:58:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:06,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:06,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:06,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:58:06,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:06,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 153029927, now seen corresponding path program 1 times [2025-03-16 19:58:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:06,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182203797] [2025-03-16 19:58:06,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:06,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:07,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:07,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:07,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:07,157 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-16 19:58:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:07,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182203797] [2025-03-16 19:58:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182203797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419131024] [2025-03-16 19:58:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:07,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:07,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:07,159 INFO L87 Difference]: Start difference. First operand 2790 states and 5035 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:07,497 INFO L93 Difference]: Finished difference Result 3514 states and 6223 transitions. [2025-03-16 19:58:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:07,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:07,507 INFO L225 Difference]: With dead ends: 3514 [2025-03-16 19:58:07,507 INFO L226 Difference]: Without dead ends: 2862 [2025-03-16 19:58:07,510 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-16 19:58:07,510 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 4684 mSDsluCounter, 8597 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4703 SdHoareTripleChecker+Valid, 12968 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:07,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4703 Valid, 12968 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-03-16 19:58:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2790. [2025-03-16 19:58:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2730 states have (on average 1.8102564102564103) internal successors, (4942), 2733 states have internal predecessors, (4942), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-16 19:58:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 5033 transitions. [2025-03-16 19:58:07,577 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 5033 transitions. Word has length 151 [2025-03-16 19:58:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:07,577 INFO L471 AbstractCegarLoop]: Abstraction has 2790 states and 5033 transitions. [2025-03-16 19:58:07,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 5033 transitions. [2025-03-16 19:58:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:07,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:07,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:07,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:58:07,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1656873658, now seen corresponding path program 1 times [2025-03-16 19:58:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:07,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205186888] [2025-03-16 19:58:07,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:07,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:07,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:07,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:07,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:07,868 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-16 19:58:07,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205186888] [2025-03-16 19:58:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205186888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:07,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787302127] [2025-03-16 19:58:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:07,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:07,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:07,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:07,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:07,870 INFO L87 Difference]: Start difference. First operand 2790 states and 5033 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:08,596 INFO L93 Difference]: Finished difference Result 3865 states and 6784 transitions. [2025-03-16 19:58:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:08,608 INFO L225 Difference]: With dead ends: 3865 [2025-03-16 19:58:08,609 INFO L226 Difference]: Without dead ends: 3213 [2025-03-16 19:58:08,612 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-16 19:58:08,612 INFO L435 NwaCegarLoop]: 4664 mSDtfsCounter, 4982 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5001 SdHoareTripleChecker+Valid, 18702 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:08,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5001 Valid, 18702 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:58:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2025-03-16 19:58:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3098. [2025-03-16 19:58:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 3011 states have (on average 1.7891066090999668) internal successors, (5387), 3015 states have internal predecessors, (5387), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-16 19:58:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 5521 transitions. [2025-03-16 19:58:08,699 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 5521 transitions. Word has length 151 [2025-03-16 19:58:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 5521 transitions. [2025-03-16 19:58:08,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 5521 transitions. [2025-03-16 19:58:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:08,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:08,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:08,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:58:08,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1949259483, now seen corresponding path program 1 times [2025-03-16 19:58:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357878889] [2025-03-16 19:58:08,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:08,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:08,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:08,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:08,881 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-16 19:58:08,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:08,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357878889] [2025-03-16 19:58:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357878889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:08,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:08,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621531545] [2025-03-16 19:58:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:08,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:08,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:08,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:08,883 INFO L87 Difference]: Start difference. First operand 3098 states and 5521 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:09,603 INFO L93 Difference]: Finished difference Result 4847 states and 8363 transitions. [2025-03-16 19:58:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:09,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:09,621 INFO L225 Difference]: With dead ends: 4847 [2025-03-16 19:58:09,621 INFO L226 Difference]: Without dead ends: 3887 [2025-03-16 19:58:09,626 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-16 19:58:09,627 INFO L435 NwaCegarLoop]: 4660 mSDtfsCounter, 4977 mSDsluCounter, 14026 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4996 SdHoareTripleChecker+Valid, 18686 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:09,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4996 Valid, 18686 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:58:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2025-03-16 19:58:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3755. [2025-03-16 19:58:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3612 states have (on average 1.7585825027685493) internal successors, (6352), 3620 states have internal predecessors, (6352), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-16 19:58:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 6578 transitions. [2025-03-16 19:58:09,750 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 6578 transitions. Word has length 151 [2025-03-16 19:58:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:09,750 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 6578 transitions. [2025-03-16 19:58:09,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 6578 transitions. [2025-03-16 19:58:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:09,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:09,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:09,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:58:09,753 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:09,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -19028634, now seen corresponding path program 1 times [2025-03-16 19:58:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153513911] [2025-03-16 19:58:09,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:09,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:09,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:09,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:09,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:09,905 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-16 19:58:09,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:09,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153513911] [2025-03-16 19:58:09,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153513911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:09,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:09,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165395209] [2025-03-16 19:58:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:09,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:09,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:09,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:09,907 INFO L87 Difference]: Start difference. First operand 3755 states and 6578 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:10,573 INFO L93 Difference]: Finished difference Result 6970 states and 11842 transitions. [2025-03-16 19:58:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:10,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:10,594 INFO L225 Difference]: With dead ends: 6970 [2025-03-16 19:58:10,594 INFO L226 Difference]: Without dead ends: 5353 [2025-03-16 19:58:10,600 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-16 19:58:10,601 INFO L435 NwaCegarLoop]: 4657 mSDtfsCounter, 4972 mSDsluCounter, 14017 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4991 SdHoareTripleChecker+Valid, 18674 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:10,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4991 Valid, 18674 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:58:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-03-16 19:58:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 5186. [2025-03-16 19:58:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 4925 states have (on average 1.7250761421319798) internal successors, (8496), 4947 states have internal predecessors, (8496), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-16 19:58:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 8930 transitions. [2025-03-16 19:58:10,732 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 8930 transitions. Word has length 151 [2025-03-16 19:58:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:10,732 INFO L471 AbstractCegarLoop]: Abstraction has 5186 states and 8930 transitions. [2025-03-16 19:58:10,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 8930 transitions. [2025-03-16 19:58:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:10,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:10,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:10,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:58:10,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:10,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -233857787, now seen corresponding path program 1 times [2025-03-16 19:58:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:10,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698804172] [2025-03-16 19:58:10,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:10,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:10,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:10,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:10,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:10,944 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-16 19:58:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:10,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698804172] [2025-03-16 19:58:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698804172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:10,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628871354] [2025-03-16 19:58:10,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:10,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:10,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:10,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:10,946 INFO L87 Difference]: Start difference. First operand 5186 states and 8930 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:11,632 INFO L93 Difference]: Finished difference Result 11665 states and 19740 transitions. [2025-03-16 19:58:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:11,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:11,675 INFO L225 Difference]: With dead ends: 11665 [2025-03-16 19:58:11,675 INFO L226 Difference]: Without dead ends: 8617 [2025-03-16 19:58:11,686 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-16 19:58:11,687 INFO L435 NwaCegarLoop]: 4654 mSDtfsCounter, 4967 mSDsluCounter, 14008 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4986 SdHoareTripleChecker+Valid, 18662 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:11,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4986 Valid, 18662 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:58:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2025-03-16 19:58:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 8381. [2025-03-16 19:58:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7866 states have (on average 1.702517162471396) internal successors, (13392), 7934 states have internal predecessors, (13392), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-16 19:58:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 14338 transitions. [2025-03-16 19:58:11,902 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 14338 transitions. Word has length 151 [2025-03-16 19:58:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:11,903 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 14338 transitions. [2025-03-16 19:58:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 14338 transitions. [2025-03-16 19:58:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:11,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:11,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:11,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:58:11,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1560327558, now seen corresponding path program 1 times [2025-03-16 19:58:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945070917] [2025-03-16 19:58:11,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:11,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:11,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:11,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:11,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:12,016 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-16 19:58:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945070917] [2025-03-16 19:58:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945070917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:12,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298256850] [2025-03-16 19:58:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:12,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:12,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:12,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:12,018 INFO L87 Difference]: Start difference. First operand 8381 states and 14338 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:12,399 INFO L93 Difference]: Finished difference Result 16118 states and 27718 transitions. [2025-03-16 19:58:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:12,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:12,433 INFO L225 Difference]: With dead ends: 16118 [2025-03-16 19:58:12,434 INFO L226 Difference]: Without dead ends: 9875 [2025-03-16 19:58:12,454 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-16 19:58:12,455 INFO L435 NwaCegarLoop]: 4358 mSDtfsCounter, 4676 mSDsluCounter, 8572 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4695 SdHoareTripleChecker+Valid, 12930 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:12,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4695 Valid, 12930 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2025-03-16 19:58:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 8381. [2025-03-16 19:58:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7866 states have (on average 1.7003559623696924) internal successors, (13375), 7934 states have internal predecessors, (13375), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-16 19:58:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 14321 transitions. [2025-03-16 19:58:12,763 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 14321 transitions. Word has length 151 [2025-03-16 19:58:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:12,763 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 14321 transitions. [2025-03-16 19:58:12,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 14321 transitions. [2025-03-16 19:58:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:12,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:12,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:12,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:58:12,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:12,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2033846501, now seen corresponding path program 1 times [2025-03-16 19:58:12,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:12,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903420578] [2025-03-16 19:58:12,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:12,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:12,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:12,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:12,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:12,875 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-16 19:58:12,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:12,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903420578] [2025-03-16 19:58:12,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903420578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:12,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:12,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:12,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323804097] [2025-03-16 19:58:12,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:12,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:12,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:12,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:12,877 INFO L87 Difference]: Start difference. First operand 8381 states and 14321 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:13,255 INFO L93 Difference]: Finished difference Result 16035 states and 27518 transitions. [2025-03-16 19:58:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:13,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:13,283 INFO L225 Difference]: With dead ends: 16035 [2025-03-16 19:58:13,283 INFO L226 Difference]: Without dead ends: 9792 [2025-03-16 19:58:13,298 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-16 19:58:13,300 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4673 mSDsluCounter, 8567 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 12922 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:13,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 12922 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2025-03-16 19:58:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 8381. [2025-03-16 19:58:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7866 states have (on average 1.6981947622679887) internal successors, (13358), 7934 states have internal predecessors, (13358), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-16 19:58:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 14304 transitions. [2025-03-16 19:58:13,520 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 14304 transitions. Word has length 151 [2025-03-16 19:58:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 14304 transitions. [2025-03-16 19:58:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 14304 transitions. [2025-03-16 19:58:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:13,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:13,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:58:13,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:13,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1830203994, now seen corresponding path program 1 times [2025-03-16 19:58:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769740923] [2025-03-16 19:58:13,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:13,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:13,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:13,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:13,706 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-16 19:58:13,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:13,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769740923] [2025-03-16 19:58:13,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769740923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94291549] [2025-03-16 19:58:13,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:13,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:13,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:13,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:13,709 INFO L87 Difference]: Start difference. First operand 8381 states and 14304 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:14,507 INFO L93 Difference]: Finished difference Result 22128 states and 37832 transitions. [2025-03-16 19:58:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:14,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:14,555 INFO L225 Difference]: With dead ends: 22128 [2025-03-16 19:58:14,555 INFO L226 Difference]: Without dead ends: 15885 [2025-03-16 19:58:14,577 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-16 19:58:14,579 INFO L435 NwaCegarLoop]: 4641 mSDtfsCounter, 4946 mSDsluCounter, 13971 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4965 SdHoareTripleChecker+Valid, 18612 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:14,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4965 Valid, 18612 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:58:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15885 states. [2025-03-16 19:58:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15885 to 15554. [2025-03-16 19:58:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15554 states, 14477 states have (on average 1.6933066243006147) internal successors, (24514), 14691 states have internal predecessors, (24514), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-16 19:58:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15554 states to 15554 states and 26868 transitions. [2025-03-16 19:58:15,118 INFO L78 Accepts]: Start accepts. Automaton has 15554 states and 26868 transitions. Word has length 151 [2025-03-16 19:58:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:15,118 INFO L471 AbstractCegarLoop]: Abstraction has 15554 states and 26868 transitions. [2025-03-16 19:58:15,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15554 states and 26868 transitions. [2025-03-16 19:58:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:15,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:15,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:15,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:58:15,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -707924795, now seen corresponding path program 1 times [2025-03-16 19:58:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598252651] [2025-03-16 19:58:15,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:15,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:15,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:15,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:15,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:15,247 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-16 19:58:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598252651] [2025-03-16 19:58:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598252651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:15,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499724180] [2025-03-16 19:58:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:15,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:15,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:15,249 INFO L87 Difference]: Start difference. First operand 15554 states and 26868 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:15,914 INFO L93 Difference]: Finished difference Result 32400 states and 56964 transitions. [2025-03-16 19:58:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:15,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:15,979 INFO L225 Difference]: With dead ends: 32400 [2025-03-16 19:58:15,979 INFO L226 Difference]: Without dead ends: 18984 [2025-03-16 19:58:16,014 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-16 19:58:16,015 INFO L435 NwaCegarLoop]: 4348 mSDtfsCounter, 4668 mSDsluCounter, 8554 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 12902 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:16,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 12902 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:58:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18984 states. [2025-03-16 19:58:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18984 to 15554. [2025-03-16 19:58:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15554 states, 14477 states have (on average 1.6910271465082545) internal successors, (24481), 14691 states have internal predecessors, (24481), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-16 19:58:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15554 states to 15554 states and 26835 transitions. [2025-03-16 19:58:16,523 INFO L78 Accepts]: Start accepts. Automaton has 15554 states and 26835 transitions. Word has length 151 [2025-03-16 19:58:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:16,523 INFO L471 AbstractCegarLoop]: Abstraction has 15554 states and 26835 transitions. [2025-03-16 19:58:16,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 15554 states and 26835 transitions. [2025-03-16 19:58:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:16,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:16,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:16,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:58:16,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:16,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 893241252, now seen corresponding path program 1 times [2025-03-16 19:58:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860177551] [2025-03-16 19:58:16,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:16,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:16,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:16,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:16,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860177551] [2025-03-16 19:58:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860177551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:16,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941464902] [2025-03-16 19:58:16,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:16,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:16,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:16,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:16,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:16,637 INFO L87 Difference]: Start difference. First operand 15554 states and 26835 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:17,842 INFO L93 Difference]: Finished difference Result 47901 states and 84136 transitions. [2025-03-16 19:58:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:17,943 INFO L225 Difference]: With dead ends: 47901 [2025-03-16 19:58:17,943 INFO L226 Difference]: Without dead ends: 34485 [2025-03-16 19:58:17,978 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-16 19:58:17,978 INFO L435 NwaCegarLoop]: 4627 mSDtfsCounter, 5238 mSDsluCounter, 13927 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5269 SdHoareTripleChecker+Valid, 18554 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:17,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5269 Valid, 18554 Invalid, 1005 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:58:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34485 states. [2025-03-16 19:58:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34485 to 31667. [2025-03-16 19:58:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31667 states, 29336 states have (on average 1.7016975729479138) internal successors, (49921), 30004 states have internal predecessors, (49921), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-16 19:58:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31667 states to 31667 states and 56563 transitions. [2025-03-16 19:58:18,982 INFO L78 Accepts]: Start accepts. Automaton has 31667 states and 56563 transitions. Word has length 151 [2025-03-16 19:58:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:18,983 INFO L471 AbstractCegarLoop]: Abstraction has 31667 states and 56563 transitions. [2025-03-16 19:58:18,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 31667 states and 56563 transitions. [2025-03-16 19:58:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:18,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:18,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:18,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:58:18,994 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:18,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 252155109, now seen corresponding path program 1 times [2025-03-16 19:58:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71468916] [2025-03-16 19:58:18,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:18,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:19,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:19,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:19,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:19,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:19,076 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-16 19:58:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71468916] [2025-03-16 19:58:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71468916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835712785] [2025-03-16 19:58:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:19,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:19,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:19,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:19,078 INFO L87 Difference]: Start difference. First operand 31667 states and 56563 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:20,669 INFO L93 Difference]: Finished difference Result 69968 states and 128716 transitions. [2025-03-16 19:58:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:20,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:20,851 INFO L225 Difference]: With dead ends: 69968 [2025-03-16 19:58:20,851 INFO L226 Difference]: Without dead ends: 40439 [2025-03-16 19:58:20,950 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-16 19:58:20,951 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4662 mSDsluCounter, 8543 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4681 SdHoareTripleChecker+Valid, 12886 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:20,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4681 Valid, 12886 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40439 states. [2025-03-16 19:58:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40439 to 31667. [2025-03-16 19:58:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31667 states, 29336 states have (on average 1.6994818652849741) internal successors, (49856), 30004 states have internal predecessors, (49856), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-16 19:58:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31667 states to 31667 states and 56498 transitions. [2025-03-16 19:58:22,536 INFO L78 Accepts]: Start accepts. Automaton has 31667 states and 56498 transitions. Word has length 151 [2025-03-16 19:58:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 31667 states and 56498 transitions. [2025-03-16 19:58:22,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 31667 states and 56498 transitions. [2025-03-16 19:58:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:22,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:22,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:58:22,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:22,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1478400900, now seen corresponding path program 1 times [2025-03-16 19:58:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596305657] [2025-03-16 19:58:22,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:22,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:22,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:22,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:22,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:22,649 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-16 19:58:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:22,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596305657] [2025-03-16 19:58:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596305657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:22,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623068780] [2025-03-16 19:58:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:22,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:22,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:22,651 INFO L87 Difference]: Start difference. First operand 31667 states and 56498 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:25,556 INFO L93 Difference]: Finished difference Result 102854 states and 190527 transitions. [2025-03-16 19:58:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:25,869 INFO L225 Difference]: With dead ends: 102854 [2025-03-16 19:58:25,869 INFO L226 Difference]: Without dead ends: 73325 [2025-03-16 19:58:25,964 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-16 19:58:25,965 INFO L435 NwaCegarLoop]: 4619 mSDtfsCounter, 5171 mSDsluCounter, 13904 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5202 SdHoareTripleChecker+Valid, 18523 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:25,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5202 Valid, 18523 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:58:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73325 states. [2025-03-16 19:58:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73325 to 68657. [2025-03-16 19:58:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68657 states, 63364 states have (on average 1.7176630263240957) internal successors, (108838), 65426 states have internal predecessors, (108838), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-16 19:58:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68657 states to 68657 states and 130136 transitions. [2025-03-16 19:58:29,169 INFO L78 Accepts]: Start accepts. Automaton has 68657 states and 130136 transitions. Word has length 151 [2025-03-16 19:58:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:29,169 INFO L471 AbstractCegarLoop]: Abstraction has 68657 states and 130136 transitions. [2025-03-16 19:58:29,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 68657 states and 130136 transitions. [2025-03-16 19:58:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:29,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:29,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:29,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:58:29,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:29,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1530084091, now seen corresponding path program 1 times [2025-03-16 19:58:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337815049] [2025-03-16 19:58:29,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:29,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:29,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:29,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:29,273 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-16 19:58:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337815049] [2025-03-16 19:58:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337815049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002140903] [2025-03-16 19:58:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:29,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:29,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:29,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:29,276 INFO L87 Difference]: Start difference. First operand 68657 states and 130136 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:32,791 INFO L93 Difference]: Finished difference Result 157066 states and 310140 transitions. [2025-03-16 19:58:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:32,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:33,178 INFO L225 Difference]: With dead ends: 157066 [2025-03-16 19:58:33,179 INFO L226 Difference]: Without dead ends: 90547 [2025-03-16 19:58:33,342 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-16 19:58:33,342 INFO L435 NwaCegarLoop]: 4338 mSDtfsCounter, 4658 mSDsluCounter, 8534 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4677 SdHoareTripleChecker+Valid, 12872 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:33,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4677 Valid, 12872 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90547 states. [2025-03-16 19:58:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90547 to 68657. [2025-03-16 19:58:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68657 states, 63364 states have (on average 1.715627170001894) internal successors, (108709), 65426 states have internal predecessors, (108709), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-16 19:58:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68657 states to 68657 states and 130007 transitions. [2025-03-16 19:58:37,117 INFO L78 Accepts]: Start accepts. Automaton has 68657 states and 130007 transitions. Word has length 151 [2025-03-16 19:58:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:37,117 INFO L471 AbstractCegarLoop]: Abstraction has 68657 states and 130007 transitions. [2025-03-16 19:58:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 68657 states and 130007 transitions. [2025-03-16 19:58:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:37,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:37,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:37,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:58:37,133 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:37,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash 451077988, now seen corresponding path program 1 times [2025-03-16 19:58:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:37,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545944135] [2025-03-16 19:58:37,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:37,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:37,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:37,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:37,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:37,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:37,205 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-16 19:58:37,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:37,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545944135] [2025-03-16 19:58:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545944135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:37,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:37,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954945987] [2025-03-16 19:58:37,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:37,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:37,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:37,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:37,207 INFO L87 Difference]: Start difference. First operand 68657 states and 130007 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:41,327 INFO L93 Difference]: Finished difference Result 154877 states and 305504 transitions. [2025-03-16 19:58:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:41,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2025-03-16 19:58:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:41,686 INFO L225 Difference]: With dead ends: 154877 [2025-03-16 19:58:41,686 INFO L226 Difference]: Without dead ends: 88358 [2025-03-16 19:58:41,813 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-16 19:58:41,814 INFO L435 NwaCegarLoop]: 4335 mSDtfsCounter, 4655 mSDsluCounter, 8529 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4674 SdHoareTripleChecker+Valid, 12864 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:41,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4674 Valid, 12864 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88358 states. [2025-03-16 19:58:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88358 to 68657. [2025-03-16 19:58:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68657 states, 63364 states have (on average 1.7135913136796919) internal successors, (108580), 65426 states have internal predecessors, (108580), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-16 19:58:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68657 states to 68657 states and 129878 transitions. [2025-03-16 19:58:46,158 INFO L78 Accepts]: Start accepts. Automaton has 68657 states and 129878 transitions. Word has length 151 [2025-03-16 19:58:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:46,158 INFO L471 AbstractCegarLoop]: Abstraction has 68657 states and 129878 transitions. [2025-03-16 19:58:46,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-16 19:58:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 68657 states and 129878 transitions. [2025-03-16 19:58:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:58:46,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:46,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:46,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:58:46,173 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:46,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:46,174 INFO L85 PathProgramCache]: Analyzing trace with hash -731939547, now seen corresponding path program 1 times [2025-03-16 19:58:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:46,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805016050] [2025-03-16 19:58:46,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:46,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:58:46,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:58:46,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:46,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:46,254 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-16 19:58:46,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:46,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805016050] [2025-03-16 19:58:46,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805016050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:46,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:46,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975568276] [2025-03-16 19:58:46,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:46,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:46,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:46,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:46,257 INFO L87 Difference]: Start difference. First operand 68657 states and 129878 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 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)