./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.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 6efc92bef151ce13307933930fbf12d828dd2fc0ecd03ad5da23928a5efb5fb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:57:32,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:57:32,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:57:32,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:57:32,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:57:32,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:57:32,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:57:32,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:57:32,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:57:32,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:57:32,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:57:32,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:57:32,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:57:32,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:57:32,596 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:57:32,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:57:32,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:57:32,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:57:32,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:57:32,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:57:32,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:57:32,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:57:32,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:57:32,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:57:32,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:57:32,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:57:32,599 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 -> 6efc92bef151ce13307933930fbf12d828dd2fc0ecd03ad5da23928a5efb5fb2 [2025-03-08 06:57:32,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:57:32,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:57:32,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:57:32,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:57:32,892 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:57:32,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c [2025-03-08 06:57:34,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa03224dc/e2eb724244764477b2b80f61dc32ecce/FLAGeedb12ddd [2025-03-08 06:57:34,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:57:34,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c [2025-03-08 06:57:34,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa03224dc/e2eb724244764477b2b80f61dc32ecce/FLAGeedb12ddd [2025-03-08 06:57:34,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa03224dc/e2eb724244764477b2b80f61dc32ecce [2025-03-08 06:57:34,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:57:34,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:57:34,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:57:34,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:57:34,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:57:34,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:57:34" (1/1) ... [2025-03-08 06:57:34,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2854d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:34, skipping insertion in model container [2025-03-08 06:57:34,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:57:34" (1/1) ... [2025-03-08 06:57:34,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:57:35,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[377612,377625] [2025-03-08 06:57:35,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[383339,383352] [2025-03-08 06:57:36,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:57:36,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:57:36,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[377612,377625] [2025-03-08 06:57:36,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[383339,383352] [2025-03-08 06:57:36,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:57:36,711 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:57:36,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36 WrapperNode [2025-03-08 06:57:36,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:57:36,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:57:36,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:57:36,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:57:36,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:36,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,136 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-03-08 06:57:37,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:57:37,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:57:37,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:57:37,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:57:37,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,320 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-08 06:57:37,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:57:37,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:57:37,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:57:37,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:57:37,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (1/1) ... [2025-03-08 06:57:37,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:57:37,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:57:37,684 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-08 06:57:37,689 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-08 06:57:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:57:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:57:37,704 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:57:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:57:37,704 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:57:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:57:37,704 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:57:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:57:37,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:57:37,705 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:57:37,705 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:57:37,705 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:57:37,705 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:57:37,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:57:37,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:57:37,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:57:37,783 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:57:37,785 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:57:44,023 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:57:44,024 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:57:44,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:57:44,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:57:44,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:57:44,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:57:44,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:57:44,210 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-03-08 06:57:44,210 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:57:44,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:57:44,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:57:44,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:57:44 BoogieIcfgContainer [2025-03-08 06:57:44,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:57:44,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:57:44,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:57:44,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:57:44,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:57:34" (1/3) ... [2025-03-08 06:57:44,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25167194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:57:44, skipping insertion in model container [2025-03-08 06:57:44,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:57:36" (2/3) ... [2025-03-08 06:57:44,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25167194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:57:44, skipping insertion in model container [2025-03-08 06:57:44,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:57:44" (3/3) ... [2025-03-08 06:57:44,284 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.03.cil-2.c [2025-03-08 06:57:44,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:57:44,298 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.03.cil-2.c that has 7 procedures, 2338 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-08 06:57:44,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:57:44,393 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;@368f371c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:57:44,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:57:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 06:57:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:44,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:44,414 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] [2025-03-08 06:57:44,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:44,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1895885998, now seen corresponding path program 1 times [2025-03-08 06:57:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796323018] [2025-03-08 06:57:44,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:44,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:44,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:44,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:44,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:44,748 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-08 06:57:44,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:44,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796323018] [2025-03-08 06:57:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796323018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:44,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:44,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80515521] [2025-03-08 06:57:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:44,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:44,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:44,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:44,777 INFO L87 Difference]: Start difference. First operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-08 06:57:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:45,220 INFO L93 Difference]: Finished difference Result 4819 states and 8863 transitions. [2025-03-08 06:57:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:57:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 77 [2025-03-08 06:57:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:45,243 INFO L225 Difference]: With dead ends: 4819 [2025-03-08 06:57:45,243 INFO L226 Difference]: Without dead ends: 2422 [2025-03-08 06:57:45,253 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-08 06:57:45,255 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 4409 mSDsluCounter, 8479 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 12679 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:45,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 12679 Invalid, 301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:57:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-03-08 06:57:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2411. [2025-03-08 06:57:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2367 states have (on average 1.830587241233629) internal successors, (4333), 2370 states have internal predecessors, (4333), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-08 06:57:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 4392 transitions. [2025-03-08 06:57:45,424 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 4392 transitions. Word has length 77 [2025-03-08 06:57:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:45,424 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 4392 transitions. [2025-03-08 06:57:45,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-08 06:57:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 4392 transitions. [2025-03-08 06:57:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:45,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:45,428 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] [2025-03-08 06:57:45,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:57:45,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:45,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 113173652, now seen corresponding path program 1 times [2025-03-08 06:57:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:45,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040763498] [2025-03-08 06:57:45,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:45,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:45,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:45,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:45,580 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-08 06:57:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040763498] [2025-03-08 06:57:45,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040763498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:45,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608108366] [2025-03-08 06:57:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:45,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:45,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:45,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:45,583 INFO L87 Difference]: Start difference. First operand 2411 states and 4392 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:45,781 INFO L93 Difference]: Finished difference Result 2714 states and 4855 transitions. [2025-03-08 06:57:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:45,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-03-08 06:57:45,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:45,791 INFO L225 Difference]: With dead ends: 2714 [2025-03-08 06:57:45,791 INFO L226 Difference]: Without dead ends: 2435 [2025-03-08 06:57:45,794 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-08 06:57:45,796 INFO L435 NwaCegarLoop]: 4119 mSDtfsCounter, 4238 mSDsluCounter, 8173 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 12292 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:45,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 12292 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:57:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-03-08 06:57:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2411. [2025-03-08 06:57:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2367 states have (on average 1.8297422898183355) internal successors, (4331), 2370 states have internal predecessors, (4331), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-08 06:57:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 4390 transitions. [2025-03-08 06:57:45,863 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 4390 transitions. Word has length 77 [2025-03-08 06:57:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:45,863 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 4390 transitions. [2025-03-08 06:57:45,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 4390 transitions. [2025-03-08 06:57:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:45,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:45,868 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] [2025-03-08 06:57:45,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:57:45,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:45,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:45,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1694673869, now seen corresponding path program 1 times [2025-03-08 06:57:45,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:45,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137486712] [2025-03-08 06:57:45,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:45,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:45,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:45,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:45,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:45,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:45,992 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-08 06:57:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:45,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137486712] [2025-03-08 06:57:45,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137486712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:45,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:45,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:57:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016597384] [2025-03-08 06:57:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:45,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:57:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:45,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:57:45,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:45,993 INFO L87 Difference]: Start difference. First operand 2411 states and 4390 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:46,337 INFO L93 Difference]: Finished difference Result 2854 states and 5053 transitions. [2025-03-08 06:57:46,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:57:46,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-03-08 06:57:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:46,346 INFO L225 Difference]: With dead ends: 2854 [2025-03-08 06:57:46,347 INFO L226 Difference]: Without dead ends: 2575 [2025-03-08 06:57:46,348 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-08 06:57:46,349 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 4323 mSDsluCounter, 12663 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 16892 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:46,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 16892 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:57:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2025-03-08 06:57:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2540. [2025-03-08 06:57:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2477 states have (on average 1.813887767460638) internal successors, (4493), 2481 states have internal predecessors, (4493), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-08 06:57:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 4579 transitions. [2025-03-08 06:57:46,401 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 4579 transitions. Word has length 77 [2025-03-08 06:57:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 4579 transitions. [2025-03-08 06:57:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 4579 transitions. [2025-03-08 06:57:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:46,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:46,404 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] [2025-03-08 06:57:46,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:57:46,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1593761902, now seen corresponding path program 1 times [2025-03-08 06:57:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298902453] [2025-03-08 06:57:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:46,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:46,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:46,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:46,520 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-08 06:57:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298902453] [2025-03-08 06:57:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298902453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:46,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:57:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038205704] [2025-03-08 06:57:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:46,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:57:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:46,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:57:46,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:46,521 INFO L87 Difference]: Start difference. First operand 2540 states and 4579 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:47,130 INFO L93 Difference]: Finished difference Result 3303 states and 5716 transitions. [2025-03-08 06:57:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:57:47,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-03-08 06:57:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:47,142 INFO L225 Difference]: With dead ends: 3303 [2025-03-08 06:57:47,142 INFO L226 Difference]: Without dead ends: 2895 [2025-03-08 06:57:47,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:57:47,145 INFO L435 NwaCegarLoop]: 4223 mSDtfsCounter, 4422 mSDsluCounter, 12640 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 16863 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:47,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 16863 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:57:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-03-08 06:57:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2801. [2025-03-08 06:57:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2700 states have (on average 1.7866666666666666) internal successors, (4824), 2708 states have internal predecessors, (4824), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-08 06:57:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4966 transitions. [2025-03-08 06:57:47,228 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4966 transitions. Word has length 77 [2025-03-08 06:57:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:47,228 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 4966 transitions. [2025-03-08 06:57:47,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4966 transitions. [2025-03-08 06:57:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:47,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:47,230 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] [2025-03-08 06:57:47,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:57:47,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:47,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1313412013, now seen corresponding path program 1 times [2025-03-08 06:57:47,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:47,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352673075] [2025-03-08 06:57:47,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:47,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:47,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:47,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:47,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:47,308 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-08 06:57:47,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:47,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352673075] [2025-03-08 06:57:47,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352673075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:47,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:47,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978082559] [2025-03-08 06:57:47,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:47,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:47,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:47,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:47,309 INFO L87 Difference]: Start difference. First operand 2801 states and 4966 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:47,502 INFO L93 Difference]: Finished difference Result 3514 states and 6040 transitions. [2025-03-08 06:57:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:47,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-03-08 06:57:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:47,512 INFO L225 Difference]: With dead ends: 3514 [2025-03-08 06:57:47,512 INFO L226 Difference]: Without dead ends: 2845 [2025-03-08 06:57:47,515 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-08 06:57:47,515 INFO L435 NwaCegarLoop]: 4110 mSDtfsCounter, 4230 mSDsluCounter, 8154 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4241 SdHoareTripleChecker+Valid, 12264 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:47,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4241 Valid, 12264 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:57:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2025-03-08 06:57:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2801. [2025-03-08 06:57:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2700 states have (on average 1.7848148148148149) internal successors, (4819), 2708 states have internal predecessors, (4819), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-08 06:57:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4961 transitions. [2025-03-08 06:57:47,579 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4961 transitions. Word has length 77 [2025-03-08 06:57:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:47,579 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 4961 transitions. [2025-03-08 06:57:47,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4961 transitions. [2025-03-08 06:57:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:47,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:47,580 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] [2025-03-08 06:57:47,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:57:47,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1050936178, now seen corresponding path program 1 times [2025-03-08 06:57:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217249908] [2025-03-08 06:57:47,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:47,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:47,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:47,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:47,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:47,653 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-08 06:57:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217249908] [2025-03-08 06:57:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217249908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:57:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985521885] [2025-03-08 06:57:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:57:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:47,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:57:47,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:47,655 INFO L87 Difference]: Start difference. First operand 2801 states and 4961 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:48,048 INFO L93 Difference]: Finished difference Result 4090 states and 6876 transitions. [2025-03-08 06:57:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:57:48,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-03-08 06:57:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:48,059 INFO L225 Difference]: With dead ends: 4090 [2025-03-08 06:57:48,059 INFO L226 Difference]: Without dead ends: 3421 [2025-03-08 06:57:48,061 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-08 06:57:48,061 INFO L435 NwaCegarLoop]: 4215 mSDtfsCounter, 4349 mSDsluCounter, 12617 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4364 SdHoareTripleChecker+Valid, 16832 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:48,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4364 Valid, 16832 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:57:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-03-08 06:57:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3329. [2025-03-08 06:57:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3148 states have (on average 1.7398348157560355) internal successors, (5477), 3170 states have internal predecessors, (5477), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-08 06:57:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5751 transitions. [2025-03-08 06:57:48,141 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5751 transitions. Word has length 77 [2025-03-08 06:57:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:48,141 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5751 transitions. [2025-03-08 06:57:48,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5751 transitions. [2025-03-08 06:57:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:48,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:48,143 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] [2025-03-08 06:57:48,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:57:48,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:48,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1681394803, now seen corresponding path program 1 times [2025-03-08 06:57:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:48,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740207866] [2025-03-08 06:57:48,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:48,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:48,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:48,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:48,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:48,197 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-08 06:57:48,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:48,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740207866] [2025-03-08 06:57:48,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740207866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:48,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:48,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:57:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019222537] [2025-03-08 06:57:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:48,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:57:48,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:48,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:57:48,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:57:48,199 INFO L87 Difference]: Start difference. First operand 3329 states and 5751 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:48,378 INFO L93 Difference]: Finished difference Result 4584 states and 7640 transitions. [2025-03-08 06:57:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-03-08 06:57:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:48,390 INFO L225 Difference]: With dead ends: 4584 [2025-03-08 06:57:48,390 INFO L226 Difference]: Without dead ends: 3387 [2025-03-08 06:57:48,394 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-08 06:57:48,394 INFO L435 NwaCegarLoop]: 4105 mSDtfsCounter, 4226 mSDsluCounter, 8145 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4237 SdHoareTripleChecker+Valid, 12250 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:48,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4237 Valid, 12250 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:57:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-03-08 06:57:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3329. [2025-03-08 06:57:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3148 states have (on average 1.7369758576874206) internal successors, (5468), 3170 states have internal predecessors, (5468), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-08 06:57:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5742 transitions. [2025-03-08 06:57:48,473 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5742 transitions. Word has length 77 [2025-03-08 06:57:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:48,473 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5742 transitions. [2025-03-08 06:57:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-08 06:57:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5742 transitions. [2025-03-08 06:57:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:57:48,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:48,475 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] [2025-03-08 06:57:48,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:57:48,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:48,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1701732178, now seen corresponding path program 1 times [2025-03-08 06:57:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138659334] [2025-03-08 06:57:48,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:48,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:57:48,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:57:48,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:48,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:48,520 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-08 06:57:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:48,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138659334] [2025-03-08 06:57:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138659334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:48,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:57:48,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:57:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479611429] [2025-03-08 06:57:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:48,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:57:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:57:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:57:48,522 INFO L87 Difference]: Start difference. First operand 3329 states and 5742 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:57:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:48,711 INFO L93 Difference]: Finished difference Result 5682 states and 9294 transitions. [2025-03-08 06:57:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:57:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:57:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:48,727 INFO L225 Difference]: With dead ends: 5682 [2025-03-08 06:57:48,727 INFO L226 Difference]: Without dead ends: 4486 [2025-03-08 06:57:48,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:57:48,733 INFO L435 NwaCegarLoop]: 4361 mSDtfsCounter, 4328 mSDsluCounter, 4298 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4328 SdHoareTripleChecker+Valid, 8659 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:48,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4328 Valid, 8659 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:57:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2025-03-08 06:57:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4477. [2025-03-08 06:57:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4121 states have (on average 1.6614899296287309) internal successors, (6847), 4172 states have internal predecessors, (6847), 206 states have call successors, (206), 108 states have call predecessors, (206), 148 states have return successors, (327), 204 states have call predecessors, (327), 206 states have call successors, (327) [2025-03-08 06:57:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 7380 transitions. [2025-03-08 06:57:48,855 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 7380 transitions. Word has length 77 [2025-03-08 06:57:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:48,855 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 7380 transitions. [2025-03-08 06:57:48,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:57:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 7380 transitions. [2025-03-08 06:57:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:57:48,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:48,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:57:48,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:57:48,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:48,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1331570662, now seen corresponding path program 1 times [2025-03-08 06:57:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537615003] [2025-03-08 06:57:48,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:48,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:48,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:48,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:48,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:57:48,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:48,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537615003] [2025-03-08 06:57:48,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537615003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:57:48,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977548002] [2025-03-08 06:57:48,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:48,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:48,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:57:48,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:57:48,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:57:48,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:49,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:49,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:49,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:57:49,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:57:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 06:57:49,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:57:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977548002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:57:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:57:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539749348] [2025-03-08 06:57:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:49,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:57:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:49,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:57:49,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:49,091 INFO L87 Difference]: Start difference. First operand 4477 states and 7380 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:57:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:49,328 INFO L93 Difference]: Finished difference Result 9074 states and 14128 transitions. [2025-03-08 06:57:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:57:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 06:57:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:49,371 INFO L225 Difference]: With dead ends: 9074 [2025-03-08 06:57:49,372 INFO L226 Difference]: Without dead ends: 6730 [2025-03-08 06:57:49,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:49,380 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4130 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4130 SdHoareTripleChecker+Valid, 4366 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:49,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4130 Valid, 4366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:57:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states. [2025-03-08 06:57:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6710. [2025-03-08 06:57:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6710 states, 6022 states have (on average 1.590501494520093) internal successors, (9578), 6122 states have internal predecessors, (9578), 390 states have call successors, (390), 216 states have call predecessors, (390), 296 states have return successors, (625), 379 states have call predecessors, (625), 390 states have call successors, (625) [2025-03-08 06:57:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 10593 transitions. [2025-03-08 06:57:49,778 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 10593 transitions. Word has length 125 [2025-03-08 06:57:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 6710 states and 10593 transitions. [2025-03-08 06:57:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:57:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 10593 transitions. [2025-03-08 06:57:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:57:49,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:49,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:57:49,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:57:49,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:49,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2139120736, now seen corresponding path program 1 times [2025-03-08 06:57:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530902195] [2025-03-08 06:57:49,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:49,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:49,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:49,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:49,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:57:50,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530902195] [2025-03-08 06:57:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530902195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:57:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822124800] [2025-03-08 06:57:50,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:50,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:50,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:57:50,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:57:50,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:57:50,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:50,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:50,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:50,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:50,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:57:50,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:57:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:57:50,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:57:50,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822124800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:50,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:57:50,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:57:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627500340] [2025-03-08 06:57:50,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:57:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:50,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:57:50,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:50,210 INFO L87 Difference]: Start difference. First operand 6710 states and 10593 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:57:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:50,545 INFO L93 Difference]: Finished difference Result 15731 states and 23779 transitions. [2025-03-08 06:57:50,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:57:50,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 06:57:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:50,578 INFO L225 Difference]: With dead ends: 15731 [2025-03-08 06:57:50,578 INFO L226 Difference]: Without dead ends: 11154 [2025-03-08 06:57:50,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:50,591 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4124 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4124 SdHoareTripleChecker+Valid, 4366 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:50,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4124 Valid, 4366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:57:50,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11154 states. [2025-03-08 06:57:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11154 to 11116. [2025-03-08 06:57:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11116 states, 9766 states have (on average 1.528568502969486) internal successors, (14928), 9964 states have internal predecessors, (14928), 756 states have call successors, (756), 432 states have call predecessors, (756), 592 states have return successors, (1219), 727 states have call predecessors, (1219), 756 states have call successors, (1219) [2025-03-08 06:57:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11116 states to 11116 states and 16903 transitions. [2025-03-08 06:57:51,235 INFO L78 Accepts]: Start accepts. Automaton has 11116 states and 16903 transitions. Word has length 125 [2025-03-08 06:57:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:51,235 INFO L471 AbstractCegarLoop]: Abstraction has 11116 states and 16903 transitions. [2025-03-08 06:57:51,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:57:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11116 states and 16903 transitions. [2025-03-08 06:57:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:57:51,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:51,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:57:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:57:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 06:57:51,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash -322962522, now seen corresponding path program 1 times [2025-03-08 06:57:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809995817] [2025-03-08 06:57:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:51,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:51,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:51,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:51,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:57:51,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809995817] [2025-03-08 06:57:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809995817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:57:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981117520] [2025-03-08 06:57:51,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:57:51,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:57:51,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:57:51,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:51,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:51,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:51,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:51,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:57:51,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:57:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 06:57:51,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:57:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981117520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:57:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:57:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286204055] [2025-03-08 06:57:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:51,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:57:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:51,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:57:51,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:51,634 INFO L87 Difference]: Start difference. First operand 11116 states and 16903 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:57:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:52,160 INFO L93 Difference]: Finished difference Result 28817 states and 42651 transitions. [2025-03-08 06:57:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:57:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 06:57:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:52,224 INFO L225 Difference]: With dead ends: 28817 [2025-03-08 06:57:52,224 INFO L226 Difference]: Without dead ends: 19834 [2025-03-08 06:57:52,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:52,250 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4136 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 4366 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:52,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 4366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:57:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19834 states. [2025-03-08 06:57:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19834 to 19760. [2025-03-08 06:57:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 17106 states have (on average 1.4832222611949024) internal successors, (25372), 17500 states have internal predecessors, (25372), 1468 states have call successors, (1468), 864 states have call predecessors, (1468), 1184 states have return successors, (2387), 1403 states have call predecessors, (2387), 1468 states have call successors, (2387) [2025-03-08 06:57:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 29227 transitions. [2025-03-08 06:57:53,263 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 29227 transitions. Word has length 125 [2025-03-08 06:57:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:53,264 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 29227 transitions. [2025-03-08 06:57:53,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:57:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 29227 transitions. [2025-03-08 06:57:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:57:53,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:53,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:57:53,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:57:53,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:53,487 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1300069716, now seen corresponding path program 1 times [2025-03-08 06:57:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829236917] [2025-03-08 06:57:53,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:53,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:53,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:53,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:53,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:57:53,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829236917] [2025-03-08 06:57:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829236917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:57:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271210202] [2025-03-08 06:57:53,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:57:53,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:57:53,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:57:53,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:57:53,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:57:53,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:53,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:53,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:57:53,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:57:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 06:57:53,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:57:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271210202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:57:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:57:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927996796] [2025-03-08 06:57:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:53,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:57:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:53,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:57:53,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:53,738 INFO L87 Difference]: Start difference. First operand 19760 states and 29227 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:57:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:55,052 INFO L93 Difference]: Finished difference Result 53967 states and 79169 transitions. [2025-03-08 06:57:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:57:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2025-03-08 06:57:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:55,165 INFO L225 Difference]: With dead ends: 53967 [2025-03-08 06:57:55,165 INFO L226 Difference]: Without dead ends: 36341 [2025-03-08 06:57:55,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:55,205 INFO L435 NwaCegarLoop]: 4368 mSDtfsCounter, 190 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 8541 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:55,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 8541 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:57:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36341 states. [2025-03-08 06:57:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36341 to 36341. [2025-03-08 06:57:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36341 states, 31256 states have (on average 1.4539608395188124) internal successors, (45445), 31971 states have internal predecessors, (45445), 2753 states have call successors, (2753), 1690 states have call predecessors, (2753), 2330 states have return successors, (5010), 2695 states have call predecessors, (5010), 2753 states have call successors, (5010) [2025-03-08 06:57:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36341 states to 36341 states and 53208 transitions. [2025-03-08 06:57:56,524 INFO L78 Accepts]: Start accepts. Automaton has 36341 states and 53208 transitions. Word has length 125 [2025-03-08 06:57:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:57:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 36341 states and 53208 transitions. [2025-03-08 06:57:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:57:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36341 states and 53208 transitions. [2025-03-08 06:57:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 06:57:56,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:57:56,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:57:56,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 06:57:56,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:56,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:57:56,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:57:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1006525213, now seen corresponding path program 1 times [2025-03-08 06:57:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:57:56,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745226727] [2025-03-08 06:57:56,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:57:56,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:57:56,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:57:56,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:56,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:57:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:57:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745226727] [2025-03-08 06:57:56,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745226727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:57:56,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924304563] [2025-03-08 06:57:56,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:57:56,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:57:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:57:56,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:57:56,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:57:56,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:57:56,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:57:56,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:57:56,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:57:56,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:57:56,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:57:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 06:57:57,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:57:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924304563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:57:57,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:57:57,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:57:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025437391] [2025-03-08 06:57:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:57:57,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:57:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:57:57,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:57:57,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:57,073 INFO L87 Difference]: Start difference. First operand 36341 states and 53208 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:57:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:57:58,763 INFO L93 Difference]: Finished difference Result 59681 states and 87291 transitions. [2025-03-08 06:57:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:57:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 180 [2025-03-08 06:57:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:57:58,889 INFO L225 Difference]: With dead ends: 59681 [2025-03-08 06:57:58,890 INFO L226 Difference]: Without dead ends: 32453 [2025-03-08 06:57:58,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:57:58,967 INFO L435 NwaCegarLoop]: 4171 mSDtfsCounter, 4104 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4104 SdHoareTripleChecker+Valid, 4215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:57:58,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4104 Valid, 4215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:57:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32453 states. [2025-03-08 06:57:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32453 to 25049. [2025-03-08 06:57:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25049 states, 21860 states have (on average 1.4274931381518756) internal successors, (31205), 22099 states have internal predecessors, (31205), 1809 states have call successors, (1809), 1186 states have call predecessors, (1809), 1378 states have return successors, (2546), 1771 states have call predecessors, (2546), 1809 states have call successors, (2546) [2025-03-08 06:57:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25049 states to 25049 states and 35560 transitions. [2025-03-08 06:58:00,011 INFO L78 Accepts]: Start accepts. Automaton has 25049 states and 35560 transitions. Word has length 180 [2025-03-08 06:58:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:58:00,011 INFO L471 AbstractCegarLoop]: Abstraction has 25049 states and 35560 transitions. [2025-03-08 06:58:00,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:58:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25049 states and 35560 transitions. [2025-03-08 06:58:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 06:58:00,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:58:00,038 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:58:00,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 06:58:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:58:00,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:58:00,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:58:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash 519408482, now seen corresponding path program 1 times [2025-03-08 06:58:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:58:00,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440523596] [2025-03-08 06:58:00,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:58:00,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:58:00,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:58:00,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:00,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:58:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:58:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440523596] [2025-03-08 06:58:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440523596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:58:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956399929] [2025-03-08 06:58:00,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:00,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:58:00,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:58:00,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:58:00,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:58:00,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:58:00,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:58:00,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:00,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:00,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:58:00,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:58:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 06:58:00,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:58:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956399929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:58:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:58:00,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:58:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470044677] [2025-03-08 06:58:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:58:00,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:58:00,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:58:00,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:58:00,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:00,479 INFO L87 Difference]: Start difference. First operand 25049 states and 35560 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:58:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:58:01,314 INFO L93 Difference]: Finished difference Result 50635 states and 71545 transitions. [2025-03-08 06:58:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:58:01,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 180 [2025-03-08 06:58:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:58:01,399 INFO L225 Difference]: With dead ends: 50635 [2025-03-08 06:58:01,400 INFO L226 Difference]: Without dead ends: 27727 [2025-03-08 06:58:01,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:01,447 INFO L435 NwaCegarLoop]: 4169 mSDtfsCounter, 4121 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 4212 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:58:01,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 4212 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:58:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27727 states. [2025-03-08 06:58:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27727 to 27727. [2025-03-08 06:58:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27727 states, 24334 states have (on average 1.388304430015616) internal successors, (33783), 24573 states have internal predecessors, (33783), 1867 states have call successors, (1867), 1332 states have call predecessors, (1867), 1524 states have return successors, (2618), 1829 states have call predecessors, (2618), 1867 states have call successors, (2618) [2025-03-08 06:58:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27727 states to 27727 states and 38268 transitions. [2025-03-08 06:58:02,593 INFO L78 Accepts]: Start accepts. Automaton has 27727 states and 38268 transitions. Word has length 180 [2025-03-08 06:58:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:58:02,593 INFO L471 AbstractCegarLoop]: Abstraction has 27727 states and 38268 transitions. [2025-03-08 06:58:02,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:58:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 27727 states and 38268 transitions. [2025-03-08 06:58:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 06:58:02,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:58:02,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:58:02,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 06:58:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:58:02,829 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:58:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:58:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -360586647, now seen corresponding path program 1 times [2025-03-08 06:58:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:58:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228942373] [2025-03-08 06:58:02,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:58:02,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:58:02,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:58:02,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:02,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:58:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:58:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228942373] [2025-03-08 06:58:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228942373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:58:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216930264] [2025-03-08 06:58:02,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:58:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:58:02,918 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:58:02,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:58:02,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:58:03,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:58:03,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:03,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:03,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:58:03,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:58:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 06:58:03,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:58:03,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216930264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:58:03,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:58:03,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:58:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514882217] [2025-03-08 06:58:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:58:03,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:58:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:58:03,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:58:03,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:03,077 INFO L87 Difference]: Start difference. First operand 27727 states and 38268 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:58:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:58:04,482 INFO L93 Difference]: Finished difference Result 49614 states and 67290 transitions. [2025-03-08 06:58:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:58:04,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 180 [2025-03-08 06:58:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:58:04,597 INFO L225 Difference]: With dead ends: 49614 [2025-03-08 06:58:04,598 INFO L226 Difference]: Without dead ends: 30171 [2025-03-08 06:58:04,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:04,646 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4111 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 4425 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:58:04,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 4425 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:58:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30171 states. [2025-03-08 06:58:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30171 to 30007. [2025-03-08 06:58:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30007 states, 26470 states have (on average 1.3618058179070647) internal successors, (36047), 26709 states have internal predecessors, (36047), 1895 states have call successors, (1895), 1448 states have call predecessors, (1895), 1640 states have return successors, (2762), 1857 states have call predecessors, (2762), 1895 states have call successors, (2762) [2025-03-08 06:58:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30007 states to 30007 states and 40704 transitions. [2025-03-08 06:58:06,357 INFO L78 Accepts]: Start accepts. Automaton has 30007 states and 40704 transitions. Word has length 180 [2025-03-08 06:58:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:58:06,358 INFO L471 AbstractCegarLoop]: Abstraction has 30007 states and 40704 transitions. [2025-03-08 06:58:06,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:58:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 30007 states and 40704 transitions. [2025-03-08 06:58:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 06:58:06,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:58:06,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:58:06,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 06:58:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:58:06,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:58:06,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:58:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash -919246193, now seen corresponding path program 1 times [2025-03-08 06:58:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:58:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576307825] [2025-03-08 06:58:06,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:58:06,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:58:06,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:58:06,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:06,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:58:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:58:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576307825] [2025-03-08 06:58:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576307825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:58:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891913271] [2025-03-08 06:58:06,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:58:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:58:06,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:58:06,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 06:58:06,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:58:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:58:06,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:06,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:58:06,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:58:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 06:58:06,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:58:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891913271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:58:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:58:06,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:58:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575407397] [2025-03-08 06:58:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:58:06,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:58:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:58:06,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:58:06,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:06,774 INFO L87 Difference]: Start difference. First operand 30007 states and 40704 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:58:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:58:08,199 INFO L93 Difference]: Finished difference Result 82235 states and 110830 transitions. [2025-03-08 06:58:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:58:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 181 [2025-03-08 06:58:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:58:08,532 INFO L225 Difference]: With dead ends: 82235 [2025-03-08 06:58:08,532 INFO L226 Difference]: Without dead ends: 54369 [2025-03-08 06:58:08,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:08,573 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 172 mSDsluCounter, 4167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 8526 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:58:08,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 8526 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:58:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54369 states. [2025-03-08 06:58:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54369 to 54367. [2025-03-08 06:58:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54367 states, 47616 states have (on average 1.3366305443548387) internal successors, (63645), 48093 states have internal predecessors, (63645), 3629 states have call successors, (3629), 2736 states have call predecessors, (3629), 3120 states have return successors, (6322), 3553 states have call predecessors, (6322), 3629 states have call successors, (6322) [2025-03-08 06:58:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54367 states to 54367 states and 73596 transitions. [2025-03-08 06:58:10,665 INFO L78 Accepts]: Start accepts. Automaton has 54367 states and 73596 transitions. Word has length 181 [2025-03-08 06:58:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:58:10,665 INFO L471 AbstractCegarLoop]: Abstraction has 54367 states and 73596 transitions. [2025-03-08 06:58:10,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:58:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 54367 states and 73596 transitions. [2025-03-08 06:58:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 06:58:10,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:58:10,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:58:10,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 06:58:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 06:58:10,923 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:58:10,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:58:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1744285188, now seen corresponding path program 1 times [2025-03-08 06:58:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:58:10,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195079282] [2025-03-08 06:58:10,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:58:10,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 06:58:10,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 06:58:10,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-08 06:58:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:58:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195079282] [2025-03-08 06:58:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195079282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:58:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725466006] [2025-03-08 06:58:10,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:10,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:58:10,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:58:10,980 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:58:10,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 06:58:11,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 06:58:11,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 06:58:11,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:11,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:11,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:58:11,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:58:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 06:58:11,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:58:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725466006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:58:11,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:58:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:58:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849350013] [2025-03-08 06:58:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:58:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:58:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:58:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:58:11,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:11,117 INFO L87 Difference]: Start difference. First operand 54367 states and 73596 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:58:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:58:13,415 INFO L93 Difference]: Finished difference Result 110473 states and 150473 transitions. [2025-03-08 06:58:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:58:13,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 182 [2025-03-08 06:58:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:58:13,764 INFO L225 Difference]: With dead ends: 110473 [2025-03-08 06:58:13,764 INFO L226 Difference]: Without dead ends: 58255 [2025-03-08 06:58:13,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:13,848 INFO L435 NwaCegarLoop]: 4177 mSDtfsCounter, 4131 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4131 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:58:13,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4131 Valid, 4219 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:58:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58255 states. [2025-03-08 06:58:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58255 to 54367. [2025-03-08 06:58:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54367 states, 47616 states have (on average 1.3161332325268817) internal successors, (62669), 48093 states have internal predecessors, (62669), 3629 states have call successors, (3629), 2736 states have call predecessors, (3629), 3120 states have return successors, (5974), 3553 states have call predecessors, (5974), 3629 states have call successors, (5974) [2025-03-08 06:58:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54367 states to 54367 states and 72272 transitions. [2025-03-08 06:58:16,542 INFO L78 Accepts]: Start accepts. Automaton has 54367 states and 72272 transitions. Word has length 182 [2025-03-08 06:58:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:58:16,542 INFO L471 AbstractCegarLoop]: Abstraction has 54367 states and 72272 transitions. [2025-03-08 06:58:16,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:58:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 54367 states and 72272 transitions. [2025-03-08 06:58:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 06:58:16,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:58:16,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:58:16,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 06:58:16,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 06:58:16,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:58:16,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:58:16,824 INFO L85 PathProgramCache]: Analyzing trace with hash -513952832, now seen corresponding path program 1 times [2025-03-08 06:58:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:58:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119149166] [2025-03-08 06:58:16,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:58:16,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 06:58:16,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 06:58:16,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:16,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 06:58:16,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:58:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119149166] [2025-03-08 06:58:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119149166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:58:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064457505] [2025-03-08 06:58:16,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:16,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:58:16,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:58:16,906 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:58:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 06:58:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 06:58:17,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 06:58:17,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:17,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:17,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:58:17,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:58:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 06:58:17,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:58:17,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064457505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:58:17,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:58:17,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:58:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759455996] [2025-03-08 06:58:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:58:17,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:58:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:58:17,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:58:17,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:58:17,039 INFO L87 Difference]: Start difference. First operand 54367 states and 72272 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)