./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+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 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:42:29,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:42:30,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:42:30,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:42:30,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:42:30,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:42:30,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:42:30,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:42:30,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:42:30,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:42:30,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:42:30,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:42:30,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:42:30,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:42:30,082 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:42:30,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:42:30,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:42:30,082 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:42:30,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:42:30,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:42:30,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:42:30,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:42:30,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:42:30,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:42:30,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:42:30,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:42:30,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:42:30,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:42:30,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:42:30,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:42:30,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:42:30,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:42:30,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:42:30,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:42:30,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:42:30,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:42:30,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:42:30,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:42:30,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:42:30,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:42:30,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:42:30,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:42:30,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:42:30,087 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 -> 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f [2025-03-03 15:42:30,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:42:30,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:42:30,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:42:30,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:42:30,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:42:30,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2025-03-03 15:42:31,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a82f170/6a981dac7e5d4164ab5d717f84ff5354/FLAG550d8b92b [2025-03-03 15:42:32,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:42:32,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2025-03-03 15:42:32,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a82f170/6a981dac7e5d4164ab5d717f84ff5354/FLAG550d8b92b [2025-03-03 15:42:32,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a82f170/6a981dac7e5d4164ab5d717f84ff5354 [2025-03-03 15:42:32,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:42:32,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:42:32,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:42:32,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:42:32,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:42:32,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:42:32" (1/1) ... [2025-03-03 15:42:32,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab5dea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:32, skipping insertion in model container [2025-03-03 15:42:32,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:42:32" (1/1) ... [2025-03-03 15:42:32,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:42:33,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[380323,380336] [2025-03-03 15:42:33,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[383339,383352] [2025-03-03 15:42:33,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:42:33,911 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:42:34,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[380323,380336] [2025-03-03 15:42:34,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c[383339,383352] [2025-03-03 15:42:34,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:42:34,451 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:42:34,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34 WrapperNode [2025-03-03 15:42:34,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:42:34,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:42:34,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:42:34,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:42:34,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:34,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:34,903 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-03-03 15:42:34,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:42:34,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:42:34,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:42:34,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:42:34,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:34,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:34,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,019 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:42:35,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:42:35,265 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:42:35,265 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:42:35,265 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:42:35,266 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (1/1) ... [2025-03-03 15:42:35,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:42:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:35,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:42:35,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:42:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:42:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:42:35,316 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:42:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:42:35,316 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:42:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:42:35,316 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:42:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:42:35,316 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:42:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:42:35,316 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:42:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:42:35,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:42:35,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:42:35,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:42:35,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:42:35,406 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:42:35,408 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:42:41,554 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:42:41,554 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:42:41,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:42:41,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:42:41,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:42:41,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:42:41,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:42:41,761 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-03-03 15:42:41,761 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:42:41,813 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:42:41,813 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:42:41,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:42:41 BoogieIcfgContainer [2025-03-03 15:42:41,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:42:41,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:42:41,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:42:41,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:42:41,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:42:32" (1/3) ... [2025-03-03 15:42:41,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3450c661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:42:41, skipping insertion in model container [2025-03-03 15:42:41,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:42:34" (2/3) ... [2025-03-03 15:42:41,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3450c661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:42:41, skipping insertion in model container [2025-03-03 15:42:41,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:42:41" (3/3) ... [2025-03-03 15:42:41,823 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-2.c [2025-03-03 15:42:41,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:42:41,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.03.cil-2.c that has 7 procedures, 2348 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-03 15:42:41,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:42:41,934 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;@423c291f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:42:41,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:42:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 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-03 15:42:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:41,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:41,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:41,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:41,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash -487538790, now seen corresponding path program 1 times [2025-03-03 15:42:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834474723] [2025-03-03 15:42:41,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:42,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:42,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:42,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:42,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834474723] [2025-03-03 15:42:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834474723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:42,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107895183] [2025-03-03 15:42:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:42,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:42,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:42,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:42,353 INFO L87 Difference]: Start difference. First operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 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.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:42,794 INFO L93 Difference]: Finished difference Result 4849 states and 8893 transitions. [2025-03-03 15:42:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:42:42,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:42,819 INFO L225 Difference]: With dead ends: 4849 [2025-03-03 15:42:42,820 INFO L226 Difference]: Without dead ends: 2442 [2025-03-03 15:42:42,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:42,834 INFO L435 NwaCegarLoop]: 4210 mSDtfsCounter, 4419 mSDsluCounter, 8509 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 12719 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:42,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 12719 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-03 15:42:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2431. [2025-03-03 15:42:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8236279849183075) internal successors, (4353), 2390 states have internal predecessors, (4353), 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-03 15:42:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4412 transitions. [2025-03-03 15:42:42,991 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4412 transitions. Word has length 79 [2025-03-03 15:42:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:42,991 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4412 transitions. [2025-03-03 15:42:42,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4412 transitions. [2025-03-03 15:42:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:42,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:42,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:42,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:42:42,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:42,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1778468956, now seen corresponding path program 1 times [2025-03-03 15:42:42,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:42,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693966473] [2025-03-03 15:42:42,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:43,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:43,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:43,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:43,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693966473] [2025-03-03 15:42:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693966473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:43,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458698153] [2025-03-03 15:42:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:43,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:43,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:43,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:43,156 INFO L87 Difference]: Start difference. First operand 2431 states and 4412 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:43,508 INFO L93 Difference]: Finished difference Result 2754 states and 4895 transitions. [2025-03-03 15:42:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:43,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:43,521 INFO L225 Difference]: With dead ends: 2754 [2025-03-03 15:42:43,522 INFO L226 Difference]: Without dead ends: 2455 [2025-03-03 15:42:43,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:43,524 INFO L435 NwaCegarLoop]: 4129 mSDtfsCounter, 4248 mSDsluCounter, 8193 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 12322 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:43,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 12322 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:42:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2025-03-03 15:42:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2431. [2025-03-03 15:42:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8227901131126938) internal successors, (4351), 2390 states have internal predecessors, (4351), 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-03 15:42:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4410 transitions. [2025-03-03 15:42:43,606 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4410 transitions. Word has length 79 [2025-03-03 15:42:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:43,606 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4410 transitions. [2025-03-03 15:42:43,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4410 transitions. [2025-03-03 15:42:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:43,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:43,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:43,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:42:43,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:43,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash -396211141, now seen corresponding path program 1 times [2025-03-03 15:42:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165289879] [2025-03-03 15:42:43,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:43,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:43,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:43,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:43,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:43,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165289879] [2025-03-03 15:42:43,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165289879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:43,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:43,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914721061] [2025-03-03 15:42:43,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:43,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:43,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:43,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:43,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:43,780 INFO L87 Difference]: Start difference. First operand 2431 states and 4410 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:44,230 INFO L93 Difference]: Finished difference Result 2904 states and 5103 transitions. [2025-03-03 15:42:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:44,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:44,241 INFO L225 Difference]: With dead ends: 2904 [2025-03-03 15:42:44,241 INFO L226 Difference]: Without dead ends: 2605 [2025-03-03 15:42:44,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:42:44,244 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 4333 mSDsluCounter, 12733 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4344 SdHoareTripleChecker+Valid, 16982 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-03 15:42:44,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4344 Valid, 16982 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:42:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-03-03 15:42:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2570. [2025-03-03 15:42:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2507 states have (on average 1.8041483845233346) internal successors, (4523), 2511 states have internal predecessors, (4523), 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-03 15:42:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 4609 transitions. [2025-03-03 15:42:44,329 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 4609 transitions. Word has length 79 [2025-03-03 15:42:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:44,329 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 4609 transitions. [2025-03-03 15:42:44,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 4609 transitions. [2025-03-03 15:42:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:44,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:44,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:44,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:42:44,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:44,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2090908634, now seen corresponding path program 1 times [2025-03-03 15:42:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:44,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661160624] [2025-03-03 15:42:44,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:44,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:44,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:44,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:44,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:44,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:44,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661160624] [2025-03-03 15:42:44,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661160624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:44,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:44,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386050568] [2025-03-03 15:42:44,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:44,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:44,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:44,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:44,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:44,481 INFO L87 Difference]: Start difference. First operand 2570 states and 4609 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:44,917 INFO L93 Difference]: Finished difference Result 3383 states and 5796 transitions. [2025-03-03 15:42:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:44,931 INFO L225 Difference]: With dead ends: 3383 [2025-03-03 15:42:44,932 INFO L226 Difference]: Without dead ends: 2945 [2025-03-03 15:42:44,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:42:44,936 INFO L435 NwaCegarLoop]: 4243 mSDtfsCounter, 4432 mSDsluCounter, 12710 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4447 SdHoareTripleChecker+Valid, 16953 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-03 15:42:44,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4447 Valid, 16953 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:42:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2025-03-03 15:42:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2851. [2025-03-03 15:42:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7723636363636364) internal successors, (4874), 2758 states have internal predecessors, (4874), 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-03 15:42:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5016 transitions. [2025-03-03 15:42:45,043 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5016 transitions. Word has length 79 [2025-03-03 15:42:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:45,045 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5016 transitions. [2025-03-03 15:42:45,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5016 transitions. [2025-03-03 15:42:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:45,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:45,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:45,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:42:45,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash 924212315, now seen corresponding path program 1 times [2025-03-03 15:42:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:45,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664266255] [2025-03-03 15:42:45,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:45,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:45,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:45,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664266255] [2025-03-03 15:42:45,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664266255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:45,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:45,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939410368] [2025-03-03 15:42:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:45,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:45,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:45,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:45,130 INFO L87 Difference]: Start difference. First operand 2851 states and 5016 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:45,365 INFO L93 Difference]: Finished difference Result 3614 states and 6140 transitions. [2025-03-03 15:42:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:45,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:45,377 INFO L225 Difference]: With dead ends: 3614 [2025-03-03 15:42:45,377 INFO L226 Difference]: Without dead ends: 2895 [2025-03-03 15:42:45,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:45,381 INFO L435 NwaCegarLoop]: 4120 mSDtfsCounter, 4240 mSDsluCounter, 8174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 12294 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-03 15:42:45,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 12294 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:42:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-03-03 15:42:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2851. [2025-03-03 15:42:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7705454545454546) internal successors, (4869), 2758 states have internal predecessors, (4869), 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-03 15:42:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5011 transitions. [2025-03-03 15:42:45,481 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5011 transitions. Word has length 79 [2025-03-03 15:42:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:45,481 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5011 transitions. [2025-03-03 15:42:45,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5011 transitions. [2025-03-03 15:42:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:45,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:45,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:45,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:42:45,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:45,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1025124282, now seen corresponding path program 1 times [2025-03-03 15:42:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:45,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077117629] [2025-03-03 15:42:45,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:45,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:45,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:45,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:45,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:45,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077117629] [2025-03-03 15:42:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077117629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:45,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:42:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895942689] [2025-03-03 15:42:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:42:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:45,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:42:45,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:45,596 INFO L87 Difference]: Start difference. First operand 2851 states and 5011 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:46,016 INFO L93 Difference]: Finished difference Result 4230 states and 7016 transitions. [2025-03-03 15:42:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:42:46,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:46,029 INFO L225 Difference]: With dead ends: 4230 [2025-03-03 15:42:46,030 INFO L226 Difference]: Without dead ends: 3511 [2025-03-03 15:42:46,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:42:46,033 INFO L435 NwaCegarLoop]: 4235 mSDtfsCounter, 4359 mSDsluCounter, 12687 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4374 SdHoareTripleChecker+Valid, 16922 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-03 15:42:46,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4374 Valid, 16922 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:42:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2025-03-03 15:42:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3419. [2025-03-03 15:42:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7192711550339717) internal successors, (5567), 3260 states have internal predecessors, (5567), 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-03 15:42:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5841 transitions. [2025-03-03 15:42:46,121 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5841 transitions. Word has length 79 [2025-03-03 15:42:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:46,122 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5841 transitions. [2025-03-03 15:42:46,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5841 transitions. [2025-03-03 15:42:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:46,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:46,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:46,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:42:46,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:46,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1305474171, now seen corresponding path program 1 times [2025-03-03 15:42:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:46,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919381869] [2025-03-03 15:42:46,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:46,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919381869] [2025-03-03 15:42:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919381869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:46,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:46,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:42:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309781015] [2025-03-03 15:42:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:46,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:42:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:42:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:42:46,200 INFO L87 Difference]: Start difference. First operand 3419 states and 5841 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:46,476 INFO L93 Difference]: Finished difference Result 4764 states and 7820 transitions. [2025-03-03 15:42:46,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:46,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:46,488 INFO L225 Difference]: With dead ends: 4764 [2025-03-03 15:42:46,488 INFO L226 Difference]: Without dead ends: 3477 [2025-03-03 15:42:46,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:46,492 INFO L435 NwaCegarLoop]: 4115 mSDtfsCounter, 4236 mSDsluCounter, 8165 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4247 SdHoareTripleChecker+Valid, 12280 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-03 15:42:46,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4247 Valid, 12280 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:42:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2025-03-03 15:42:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3419. [2025-03-03 15:42:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7164916615194565) internal successors, (5558), 3260 states have internal predecessors, (5558), 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-03 15:42:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5832 transitions. [2025-03-03 15:42:46,570 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5832 transitions. Word has length 79 [2025-03-03 15:42:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:46,570 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5832 transitions. [2025-03-03 15:42:46,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5832 transitions. [2025-03-03 15:42:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:42:46,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:46,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:46,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:42:46,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:46,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash -625144934, now seen corresponding path program 1 times [2025-03-03 15:42:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:46,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003840895] [2025-03-03 15:42:46,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:46,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:42:46,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:42:46,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:46,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:42:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:46,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003840895] [2025-03-03 15:42:46,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003840895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:46,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:42:46,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:42:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590334919] [2025-03-03 15:42:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:46,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:42:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:46,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:42:46,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:42:46,614 INFO L87 Difference]: Start difference. First operand 3419 states and 5832 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:46,788 INFO L93 Difference]: Finished difference Result 5943 states and 9555 transitions. [2025-03-03 15:42:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:42:46,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-03-03 15:42:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:46,812 INFO L225 Difference]: With dead ends: 5943 [2025-03-03 15:42:46,812 INFO L226 Difference]: Without dead ends: 4657 [2025-03-03 15:42:46,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:42:46,819 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4347 mSDsluCounter, 4317 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 8697 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-03 15:42:46,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 8697 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:42:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2025-03-03 15:42:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4648. [2025-03-03 15:42:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 4292 states have (on average 1.635135135135135) internal successors, (7018), 4343 states have internal predecessors, (7018), 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-03 15:42:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 7551 transitions. [2025-03-03 15:42:46,954 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 7551 transitions. Word has length 79 [2025-03-03 15:42:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:46,954 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 7551 transitions. [2025-03-03 15:42:46,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:42:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 7551 transitions. [2025-03-03 15:42:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:42:46,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:46,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:46,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:42:46,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:46,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1353994054, now seen corresponding path program 1 times [2025-03-03 15:42:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:46,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185601046] [2025-03-03 15:42:46,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:46,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:46,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:46,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:46,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:47,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185601046] [2025-03-03 15:42:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185601046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276075098] [2025-03-03 15:42:47,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:47,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:47,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:47,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:42:47,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:47,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:47,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:47,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:47,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:47,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:42:47,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276075098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:47,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:47,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484016260] [2025-03-03 15:42:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:47,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:47,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:47,171 INFO L87 Difference]: Start difference. First operand 4648 states and 7551 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:42:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:47,338 INFO L93 Difference]: Finished difference Result 9587 states and 14641 transitions. [2025-03-03 15:42:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:47,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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 130 [2025-03-03 15:42:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:47,365 INFO L225 Difference]: With dead ends: 9587 [2025-03-03 15:42:47,366 INFO L226 Difference]: Without dead ends: 7072 [2025-03-03 15:42:47,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:47,378 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:47,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4140 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7072 states. [2025-03-03 15:42:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7072 to 7016. [2025-03-03 15:42:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 6328 states have (on average 1.5619469026548674) internal successors, (9884), 6428 states have internal predecessors, (9884), 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-03 15:42:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 10899 transitions. [2025-03-03 15:42:47,698 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 10899 transitions. Word has length 130 [2025-03-03 15:42:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:47,698 INFO L471 AbstractCegarLoop]: Abstraction has 7016 states and 10899 transitions. [2025-03-03 15:42:47,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:42:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 10899 transitions. [2025-03-03 15:42:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:42:47,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:47,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:47,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:42:47,906 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-03 15:42:47,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:47,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash -928323724, now seen corresponding path program 1 times [2025-03-03 15:42:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626979409] [2025-03-03 15:42:47,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:47,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:47,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:47,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:47,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:47,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626979409] [2025-03-03 15:42:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626979409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:47,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421218512] [2025-03-03 15:42:47,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:47,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:47,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:47,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:42:48,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:48,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:48,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:48,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:48,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:48,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:42:48,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:48,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421218512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:48,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:48,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880974169] [2025-03-03 15:42:48,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:48,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:48,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:48,135 INFO L87 Difference]: Start difference. First operand 7016 states and 10899 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:42:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:48,480 INFO L93 Difference]: Finished difference Result 16649 states and 24697 transitions. [2025-03-03 15:42:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:48,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 130 [2025-03-03 15:42:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:48,513 INFO L225 Difference]: With dead ends: 16649 [2025-03-03 15:42:48,513 INFO L226 Difference]: Without dead ends: 11766 [2025-03-03 15:42:48,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:48,525 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:48,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11766 states. [2025-03-03 15:42:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11766 to 11656. [2025-03-03 15:42:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11656 states, 10306 states have (on average 1.5008732777023093) internal successors, (15468), 10504 states have internal predecessors, (15468), 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-03 15:42:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11656 states to 11656 states and 17443 transitions. [2025-03-03 15:42:48,915 INFO L78 Accepts]: Start accepts. Automaton has 11656 states and 17443 transitions. Word has length 130 [2025-03-03 15:42:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:48,915 INFO L471 AbstractCegarLoop]: Abstraction has 11656 states and 17443 transitions. [2025-03-03 15:42:48,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:42:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 11656 states and 17443 transitions. [2025-03-03 15:42:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:42:48,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:48,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:48,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:42:49,130 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-03 15:42:49,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1283469742, now seen corresponding path program 1 times [2025-03-03 15:42:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793821678] [2025-03-03 15:42:49,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:49,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:49,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:49,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:49,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:49,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793821678] [2025-03-03 15:42:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793821678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834632197] [2025-03-03 15:42:49,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:49,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:49,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:49,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:42:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:49,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:49,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:49,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:49,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:49,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:42:49,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:49,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834632197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:49,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:42:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567370058] [2025-03-03 15:42:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:49,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:49,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:49,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:49,324 INFO L87 Difference]: Start difference. First operand 11656 states and 17443 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:42:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:50,126 INFO L93 Difference]: Finished difference Result 30437 states and 44271 transitions. [2025-03-03 15:42:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:50,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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 130 [2025-03-03 15:42:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:50,202 INFO L225 Difference]: With dead ends: 30437 [2025-03-03 15:42:50,202 INFO L226 Difference]: Without dead ends: 20914 [2025-03-03 15:42:50,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:50,233 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4146 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:50,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20914 states. [2025-03-03 15:42:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20914 to 20696. [2025-03-03 15:42:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20696 states, 18042 states have (on average 1.4581531980933378) internal successors, (26308), 18436 states have internal predecessors, (26308), 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-03 15:42:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 30163 transitions. [2025-03-03 15:42:50,964 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 30163 transitions. Word has length 130 [2025-03-03 15:42:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:50,966 INFO L471 AbstractCegarLoop]: Abstraction has 20696 states and 30163 transitions. [2025-03-03 15:42:50,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:42:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 30163 transitions. [2025-03-03 15:42:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:42:50,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:50,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:50,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:42:51,186 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-03 15:42:51,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:51,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1570376472, now seen corresponding path program 1 times [2025-03-03 15:42:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101099518] [2025-03-03 15:42:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:51,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:51,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:51,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:51,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:42:51,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101099518] [2025-03-03 15:42:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101099518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053411906] [2025-03-03 15:42:51,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:51,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:51,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:51,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:42:51,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:42:51,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:42:51,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:51,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:51,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:51,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:42:51,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053411906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:51,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218946279] [2025-03-03 15:42:51,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:51,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:51,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:51,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:51,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:51,372 INFO L87 Difference]: Start difference. First operand 20696 states and 30163 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:42:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:52,383 INFO L93 Difference]: Finished difference Result 56559 states and 81761 transitions. [2025-03-03 15:42:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 130 [2025-03-03 15:42:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:52,551 INFO L225 Difference]: With dead ends: 56559 [2025-03-03 15:42:52,551 INFO L226 Difference]: Without dead ends: 37997 [2025-03-03 15:42:52,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:52,589 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 197 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8567 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:52,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8567 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37997 states. [2025-03-03 15:42:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37997 to 37997. [2025-03-03 15:42:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37997 states, 32912 states have (on average 1.4311193485658726) internal successors, (47101), 33627 states have internal predecessors, (47101), 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-03 15:42:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37997 states to 37997 states and 54864 transitions. [2025-03-03 15:42:54,419 INFO L78 Accepts]: Start accepts. Automaton has 37997 states and 54864 transitions. Word has length 130 [2025-03-03 15:42:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:54,419 INFO L471 AbstractCegarLoop]: Abstraction has 37997 states and 54864 transitions. [2025-03-03 15:42:54,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:42:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 37997 states and 54864 transitions. [2025-03-03 15:42:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:42:54,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:54,513 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:54,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:42:54,713 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-03 15:42:54,714 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:54,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash -673862789, now seen corresponding path program 1 times [2025-03-03 15:42:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:54,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516243193] [2025-03-03 15:42:54,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:54,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:42:54,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:42:54,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:54,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:42:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516243193] [2025-03-03 15:42:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516243193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524558505] [2025-03-03 15:42:54,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:54,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:54,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:54,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:54,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:42:54,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:42:54,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:42:54,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:54,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:54,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:54,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 15:42:55,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524558505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:55,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:55,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010287866] [2025-03-03 15:42:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:55,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:55,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:55,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:55,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:55,025 INFO L87 Difference]: Start difference. First operand 37997 states and 54864 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:42:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:56,301 INFO L93 Difference]: Finished difference Result 62381 states and 89991 transitions. [2025-03-03 15:42:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:56,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 189 [2025-03-03 15:42:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:56,437 INFO L225 Difference]: With dead ends: 62381 [2025-03-03 15:42:56,438 INFO L226 Difference]: Without dead ends: 33881 [2025-03-03 15:42:56,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:56,505 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4108 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4108 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:56,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4108 Valid, 4225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33881 states. [2025-03-03 15:42:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33881 to 26045. [2025-03-03 15:42:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26045 states, 22856 states have (on average 1.4088641932096604) internal successors, (32201), 23095 states have internal predecessors, (32201), 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-03 15:42:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26045 states to 26045 states and 36556 transitions. [2025-03-03 15:42:57,600 INFO L78 Accepts]: Start accepts. Automaton has 26045 states and 36556 transitions. Word has length 189 [2025-03-03 15:42:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:42:57,600 INFO L471 AbstractCegarLoop]: Abstraction has 26045 states and 36556 transitions. [2025-03-03 15:42:57,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:42:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 26045 states and 36556 transitions. [2025-03-03 15:42:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:42:57,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:42:57,627 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:42:57,633 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-03 15:42:57,831 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-03 15:42:57,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:42:57,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:42:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1462486276, now seen corresponding path program 1 times [2025-03-03 15:42:57,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:42:57,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647198853] [2025-03-03 15:42:57,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:57,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:42:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:42:57,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:42:57,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:57,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:42:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:42:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647198853] [2025-03-03 15:42:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647198853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:42:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182987273] [2025-03-03 15:42:57,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:42:57,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:42:57,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:42:57,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:42:57,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:42:57,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:42:58,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:42:58,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:42:58,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:42:58,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:42:58,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:42:58,147 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:42:58,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:42:58,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182987273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:42:58,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:42:58,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:42:58,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978281944] [2025-03-03 15:42:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:42:58,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:42:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:42:58,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:42:58,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:58,149 INFO L87 Difference]: Start difference. First operand 26045 states and 36556 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:42:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:42:58,850 INFO L93 Difference]: Finished difference Result 52627 states and 73537 transitions. [2025-03-03 15:42:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:42:58,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 189 [2025-03-03 15:42:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:42:58,946 INFO L225 Difference]: With dead ends: 52627 [2025-03-03 15:42:58,946 INFO L226 Difference]: Without dead ends: 28723 [2025-03-03 15:42:58,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:42:58,999 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4125 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4125 SdHoareTripleChecker+Valid, 4222 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:42:59,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4125 Valid, 4222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:42:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28723 states. [2025-03-03 15:43:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28723 to 28723. [2025-03-03 15:43:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28723 states, 25330 states have (on average 1.3730359257797078) internal successors, (34779), 25569 states have internal predecessors, (34779), 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-03 15:43:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 39264 transitions. [2025-03-03 15:43:00,739 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 39264 transitions. Word has length 189 [2025-03-03 15:43:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:00,739 INFO L471 AbstractCegarLoop]: Abstraction has 28723 states and 39264 transitions. [2025-03-03 15:43:00,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:43:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 39264 transitions. [2025-03-03 15:43:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:43:00,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:00,773 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, 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, 1, 1] [2025-03-03 15:43:00,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:43:00,977 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-03 15:43:00,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:00,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:00,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1024898977, now seen corresponding path program 1 times [2025-03-03 15:43:00,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544699548] [2025-03-03 15:43:00,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:00,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:43:00,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:43:00,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544699548] [2025-03-03 15:43:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544699548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077583285] [2025-03-03 15:43:01,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:01,076 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:43:01,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:43:01,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:43:01,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:43:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:01,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:43:01,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 15:43:01,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:01,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077583285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:01,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:01,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:43:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783215127] [2025-03-03 15:43:01,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:01,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:01,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:01,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:01,239 INFO L87 Difference]: Start difference. First operand 28723 states and 39264 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:43:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:02,457 INFO L93 Difference]: Finished difference Result 51390 states and 69066 transitions. [2025-03-03 15:43:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:02,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 189 [2025-03-03 15:43:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:02,586 INFO L225 Difference]: With dead ends: 51390 [2025-03-03 15:43:02,587 INFO L226 Difference]: Without dead ends: 31167 [2025-03-03 15:43:02,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:02,622 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4117 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 4449 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:02,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 4449 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31167 states. [2025-03-03 15:43:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31167 to 31003. [2025-03-03 15:43:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31003 states, 27466 states have (on average 1.3486856477098959) internal successors, (37043), 27705 states have internal predecessors, (37043), 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-03 15:43:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31003 states to 31003 states and 41700 transitions. [2025-03-03 15:43:03,710 INFO L78 Accepts]: Start accepts. Automaton has 31003 states and 41700 transitions. Word has length 189 [2025-03-03 15:43:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:03,710 INFO L471 AbstractCegarLoop]: Abstraction has 31003 states and 41700 transitions. [2025-03-03 15:43:03,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:43:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31003 states and 41700 transitions. [2025-03-03 15:43:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 15:43:03,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:03,738 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:43:03,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:43:03,939 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-03 15:43:03,939 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:03,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1565769217, now seen corresponding path program 1 times [2025-03-03 15:43:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:03,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53287883] [2025-03-03 15:43:03,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:03,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:43:03,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:43:03,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:03,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:43:04,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53287883] [2025-03-03 15:43:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53287883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948754006] [2025-03-03 15:43:04,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:04,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:04,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:04,009 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:43:04,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:43:04,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:43:04,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:43:04,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:04,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:04,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:43:04,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:43:04,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948754006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:04,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:04,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:43:04,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342940833] [2025-03-03 15:43:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:04,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:04,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:04,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:04,144 INFO L87 Difference]: Start difference. First operand 31003 states and 41700 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:05,945 INFO L93 Difference]: Finished difference Result 85063 states and 113658 transitions. [2025-03-03 15:43:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:05,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (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 190 [2025-03-03 15:43:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:06,187 INFO L225 Difference]: With dead ends: 85063 [2025-03-03 15:43:06,187 INFO L226 Difference]: Without dead ends: 56201 [2025-03-03 15:43:06,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:06,261 INFO L435 NwaCegarLoop]: 4376 mSDtfsCounter, 179 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 8552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:06,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 8552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56201 states. [2025-03-03 15:43:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56201 to 56199. [2025-03-03 15:43:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56199 states, 49448 states have (on average 1.3241587121824947) internal successors, (65477), 49925 states have internal predecessors, (65477), 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-03 15:43:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56199 states to 56199 states and 75428 transitions. [2025-03-03 15:43:08,993 INFO L78 Accepts]: Start accepts. Automaton has 56199 states and 75428 transitions. Word has length 190 [2025-03-03 15:43:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:08,994 INFO L471 AbstractCegarLoop]: Abstraction has 56199 states and 75428 transitions. [2025-03-03 15:43:08,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56199 states and 75428 transitions. [2025-03-03 15:43:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 15:43:09,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:09,048 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:43:09,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:43:09,248 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-03 15:43:09,249 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:09,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1460166588, now seen corresponding path program 1 times [2025-03-03 15:43:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982423723] [2025-03-03 15:43:09,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:09,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:43:09,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:43:09,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:09,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 15:43:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982423723] [2025-03-03 15:43:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982423723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086036515] [2025-03-03 15:43:09,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:09,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:09,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:09,303 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:43:09,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:43:09,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:43:09,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:43:09,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:09,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:09,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:43:09,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 15:43:09,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086036515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:09,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:43:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695955666] [2025-03-03 15:43:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:09,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:09,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:09,444 INFO L87 Difference]: Start difference. First operand 56199 states and 75428 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:11,483 INFO L93 Difference]: Finished difference Result 114137 states and 154137 transitions. [2025-03-03 15:43:11,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:11,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 191 [2025-03-03 15:43:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:11,678 INFO L225 Difference]: With dead ends: 114137 [2025-03-03 15:43:11,678 INFO L226 Difference]: Without dead ends: 60087 [2025-03-03 15:43:11,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:11,763 INFO L435 NwaCegarLoop]: 4187 mSDtfsCounter, 4138 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:11,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60087 states. [2025-03-03 15:43:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60087 to 56199. [2025-03-03 15:43:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56199 states, 49448 states have (on average 1.3044208056948714) internal successors, (64501), 49925 states have internal predecessors, (64501), 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-03 15:43:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56199 states to 56199 states and 74104 transitions. [2025-03-03 15:43:15,181 INFO L78 Accepts]: Start accepts. Automaton has 56199 states and 74104 transitions. Word has length 191 [2025-03-03 15:43:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:15,181 INFO L471 AbstractCegarLoop]: Abstraction has 56199 states and 74104 transitions. [2025-03-03 15:43:15,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 56199 states and 74104 transitions. [2025-03-03 15:43:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 15:43:15,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:15,228 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, 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, 1, 1, 1, 1] [2025-03-03 15:43:15,234 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-03 15:43:15,428 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-03 15:43:15,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:15,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash -818246298, now seen corresponding path program 1 times [2025-03-03 15:43:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788089510] [2025-03-03 15:43:15,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:15,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:43:15,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:43:15,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:15,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 15:43:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788089510] [2025-03-03 15:43:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788089510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:43:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864338075] [2025-03-03 15:43:15,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:43:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:15,494 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:43:15,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:43:15,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:43:15,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:43:15,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:15,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:15,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:43:15,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:43:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 15:43:15,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:43:15,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864338075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:15,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:43:15,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:43:15,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692883977] [2025-03-03 15:43:15,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:15,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:43:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:15,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:43:15,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:15,614 INFO L87 Difference]: Start difference. First operand 56199 states and 74104 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:43:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:18,808 INFO L93 Difference]: Finished difference Result 161711 states and 213472 transitions. [2025-03-03 15:43:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:43:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 191 [2025-03-03 15:43:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:19,197 INFO L225 Difference]: With dead ends: 161711 [2025-03-03 15:43:19,197 INFO L226 Difference]: Without dead ends: 107661 [2025-03-03 15:43:19,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:19,299 INFO L435 NwaCegarLoop]: 4373 mSDtfsCounter, 189 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 8545 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:19,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 8545 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:43:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107661 states.