./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.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 c7c4bef8c60b810569a22d8a73144498437260dfbc0e4b7320d169bed033790e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:58:41,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:58:41,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:58:41,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:58:41,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:58:41,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:58:41,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:58:41,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:58:41,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:58:41,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:58:41,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:58:41,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:58:41,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:58:41,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:58:41,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:58:41,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:58:41,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:58:41,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:58:41,434 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 -> c7c4bef8c60b810569a22d8a73144498437260dfbc0e4b7320d169bed033790e [2025-03-16 19:58:41,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:58:41,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:58:41,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:58:41,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:58:41,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:58:41,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c [2025-03-16 19:58:42,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de33513b9/fda0d9c710174e9d90b116920982733e/FLAG94aa4e4b5 [2025-03-16 19:58:43,501 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:58:43,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.02.cil-2.c [2025-03-16 19:58:43,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de33513b9/fda0d9c710174e9d90b116920982733e/FLAG94aa4e4b5 [2025-03-16 19:58:43,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de33513b9/fda0d9c710174e9d90b116920982733e [2025-03-16 19:58:43,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:58:43,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:58:43,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:58:43,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:58:43,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:58:43,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:58:43" (1/1) ... [2025-03-16 19:58:43,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a0c571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:43, skipping insertion in model container [2025-03-16 19:58:43,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:58:43" (1/1) ... [2025-03-16 19:58:44,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:58:45,079 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_label43+token_ring.02.cil-2.c[381679,381692] [2025-03-16 19:58:45,106 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_label43+token_ring.02.cil-2.c[383339,383352] [2025-03-16 19:58:45,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:58:45,249 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:58:45,814 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_label43+token_ring.02.cil-2.c[381679,381692] [2025-03-16 19:58:45,818 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_label43+token_ring.02.cil-2.c[383339,383352] [2025-03-16 19:58:45,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:58:45,875 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:58:45,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45 WrapperNode [2025-03-16 19:58:45,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:58:45,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:58:45,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:58:45,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:58:45,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:45,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,211 INFO L138 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12621 [2025-03-16 19:58:46,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:58:46,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:58:46,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:58:46,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:58:46,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,403 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:58:46,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:58:46,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:58:46,750 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:58:46,751 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:58:46,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (1/1) ... [2025-03-16 19:58:46,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:58:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:58:46,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:58:46,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:58:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:58:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:58:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:58:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:58:46,937 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:58:46,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:58:52,848 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:58:52,849 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:58:52,849 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:58:52,849 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:58:52,850 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:58:52,850 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:58:52,851 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:58:53,021 INFO L? ?]: Removed 1694 outVars from TransFormulas that were not future-live. [2025-03-16 19:58:53,021 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:58:53,079 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:58:53,079 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:58:53,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:58:53 BoogieIcfgContainer [2025-03-16 19:58:53,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:58:53,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:58:53,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:58:53,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:58:53,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:58:43" (1/3) ... [2025-03-16 19:58:53,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f541cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:58:53, skipping insertion in model container [2025-03-16 19:58:53,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:45" (2/3) ... [2025-03-16 19:58:53,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f541cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:58:53, skipping insertion in model container [2025-03-16 19:58:53,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:58:53" (3/3) ... [2025-03-16 19:58:53,090 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.02.cil-2.c [2025-03-16 19:58:53,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:58:53,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.02.cil-2.c that has 8 procedures, 2253 locations, 1 initial locations, 6 loop locations, and 2 error locations. [2025-03-16 19:58:53,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:58:53,202 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;@7f092842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:58:53,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:58:53,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 2253 states, 2226 states have (on average 1.880952380952381) internal successors, (4187), 2230 states have internal predecessors, (4187), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 19:58:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:58:53,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:53,222 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] [2025-03-16 19:58:53,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:53,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1805019807, now seen corresponding path program 1 times [2025-03-16 19:58:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151567912] [2025-03-16 19:58:53,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:53,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:53,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:58:53,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:58:53,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:53,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:53,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:53,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151567912] [2025-03-16 19:58:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151567912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:58:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884203502] [2025-03-16 19:58:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:53,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:58:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:53,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:58:53,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:58:53,469 INFO L87 Difference]: Start difference. First operand has 2253 states, 2226 states have (on average 1.880952380952381) internal successors, (4187), 2230 states have internal predecessors, (4187), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:53,640 INFO L93 Difference]: Finished difference Result 4500 states and 8435 transitions. [2025-03-16 19:58:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:58:53,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-16 19:58:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:53,670 INFO L225 Difference]: With dead ends: 4500 [2025-03-16 19:58:53,672 INFO L226 Difference]: Without dead ends: 2246 [2025-03-16 19:58:53,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:58:53,685 INFO L435 NwaCegarLoop]: 4152 mSDtfsCounter, 186 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 8113 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:53,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 8113 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:58:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-03-16 19:58:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2025-03-16 19:58:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2220 states have (on average 1.8518018018018019) internal successors, (4111), 2223 states have internal predecessors, (4111), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 19:58:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 4145 transitions. [2025-03-16 19:58:53,811 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 4145 transitions. Word has length 62 [2025-03-16 19:58:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:53,812 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 4145 transitions. [2025-03-16 19:58:53,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 4145 transitions. [2025-03-16 19:58:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:58:53,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:53,815 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] [2025-03-16 19:58:53,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:58:53,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2051937986, now seen corresponding path program 1 times [2025-03-16 19:58:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708065910] [2025-03-16 19:58:53,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:53,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:58:53,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:58:53,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:53,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708065910] [2025-03-16 19:58:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708065910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13373723] [2025-03-16 19:58:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:53,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:53,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:53,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:53,999 INFO L87 Difference]: Start difference. First operand 2246 states and 4145 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:54,349 INFO L93 Difference]: Finished difference Result 2489 states and 4514 transitions. [2025-03-16 19:58:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:58:54,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-16 19:58:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:54,361 INFO L225 Difference]: With dead ends: 2489 [2025-03-16 19:58:54,361 INFO L226 Difference]: Without dead ends: 2372 [2025-03-16 19:58:54,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:54,363 INFO L435 NwaCegarLoop]: 4103 mSDtfsCounter, 4260 mSDsluCounter, 8265 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4270 SdHoareTripleChecker+Valid, 12368 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:54,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4270 Valid, 12368 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:58:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2025-03-16 19:58:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2361. [2025-03-16 19:58:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2317 states have (on average 1.8390159689253345) internal successors, (4261), 2321 states have internal predecessors, (4261), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2025-03-16 19:58:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 4318 transitions. [2025-03-16 19:58:54,424 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 4318 transitions. Word has length 62 [2025-03-16 19:58:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:54,424 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 4318 transitions. [2025-03-16 19:58:54,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 4318 transitions. [2025-03-16 19:58:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:58:54,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:54,426 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] [2025-03-16 19:58:54,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:58:54,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:54,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1176845470, now seen corresponding path program 1 times [2025-03-16 19:58:54,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:54,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773706594] [2025-03-16 19:58:54,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:54,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:58:54,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:58:54,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:54,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:54,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:54,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773706594] [2025-03-16 19:58:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773706594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:54,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525987744] [2025-03-16 19:58:54,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:54,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:54,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:54,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:54,532 INFO L87 Difference]: Start difference. First operand 2361 states and 4318 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:54,720 INFO L93 Difference]: Finished difference Result 2611 states and 4700 transitions. [2025-03-16 19:58:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-16 19:58:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:54,732 INFO L225 Difference]: With dead ends: 2611 [2025-03-16 19:58:54,733 INFO L226 Difference]: Without dead ends: 2379 [2025-03-16 19:58:54,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:54,735 INFO L435 NwaCegarLoop]: 4093 mSDtfsCounter, 4183 mSDsluCounter, 8127 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4193 SdHoareTripleChecker+Valid, 12220 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:54,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4193 Valid, 12220 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:58:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-16 19:58:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2361. [2025-03-16 19:58:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 2317 states have (on average 1.8381527837721192) internal successors, (4259), 2321 states have internal predecessors, (4259), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2025-03-16 19:58:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 4316 transitions. [2025-03-16 19:58:54,787 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 4316 transitions. Word has length 62 [2025-03-16 19:58:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:54,787 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 4316 transitions. [2025-03-16 19:58:54,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 4316 transitions. [2025-03-16 19:58:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:58:54,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:54,789 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] [2025-03-16 19:58:54,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:58:54,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:54,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1417385599, now seen corresponding path program 1 times [2025-03-16 19:58:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708872319] [2025-03-16 19:58:54,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:54,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:58:54,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:58:54,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:54,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:54,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708872319] [2025-03-16 19:58:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708872319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586919008] [2025-03-16 19:58:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:54,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:54,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:54,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:54,910 INFO L87 Difference]: Start difference. First operand 2361 states and 4316 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:55,259 INFO L93 Difference]: Finished difference Result 2731 states and 4869 transitions. [2025-03-16 19:58:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-16 19:58:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:55,268 INFO L225 Difference]: With dead ends: 2731 [2025-03-16 19:58:55,269 INFO L226 Difference]: Without dead ends: 2499 [2025-03-16 19:58:55,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:58:55,271 INFO L435 NwaCegarLoop]: 4194 mSDtfsCounter, 4241 mSDsluCounter, 12544 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 16738 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:55,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 16738 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-03-16 19:58:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2468. [2025-03-16 19:58:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2406 states have (on average 1.825436408977556) internal successors, (4392), 2411 states have internal predecessors, (4392), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2025-03-16 19:58:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 4474 transitions. [2025-03-16 19:58:55,324 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 4474 transitions. Word has length 62 [2025-03-16 19:58:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:55,325 INFO L471 AbstractCegarLoop]: Abstraction has 2468 states and 4474 transitions. [2025-03-16 19:58:55,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 4474 transitions. [2025-03-16 19:58:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:58:55,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:55,327 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] [2025-03-16 19:58:55,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:58:55,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:55,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1425144958, now seen corresponding path program 1 times [2025-03-16 19:58:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12656655] [2025-03-16 19:58:55,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:55,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:58:55,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:58:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:55,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12656655] [2025-03-16 19:58:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12656655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:55,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:55,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:58:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505381126] [2025-03-16 19:58:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:55,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:58:55,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:55,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:58:55,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:55,432 INFO L87 Difference]: Start difference. First operand 2468 states and 4474 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:55,873 INFO L93 Difference]: Finished difference Result 3091 states and 5405 transitions. [2025-03-16 19:58:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:58:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-16 19:58:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:55,884 INFO L225 Difference]: With dead ends: 3091 [2025-03-16 19:58:55,884 INFO L226 Difference]: Without dead ends: 2752 [2025-03-16 19:58:55,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:58:55,887 INFO L435 NwaCegarLoop]: 4188 mSDtfsCounter, 4301 mSDsluCounter, 12521 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4314 SdHoareTripleChecker+Valid, 16709 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:55,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4314 Valid, 16709 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:58:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-03-16 19:58:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2683. [2025-03-16 19:58:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 2585 states have (on average 1.8030947775628627) internal successors, (4661), 2594 states have internal predecessors, (4661), 60 states have call successors, (60), 31 states have call predecessors, (60), 36 states have return successors, (74), 61 states have call predecessors, (74), 58 states have call successors, (74) [2025-03-16 19:58:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4795 transitions. [2025-03-16 19:58:55,973 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4795 transitions. Word has length 62 [2025-03-16 19:58:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 2683 states and 4795 transitions. [2025-03-16 19:58:55,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4795 transitions. [2025-03-16 19:58:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:58:55,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:55,975 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] [2025-03-16 19:58:55,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:58:55,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:55,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash -455563935, now seen corresponding path program 1 times [2025-03-16 19:58:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:55,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055272356] [2025-03-16 19:58:55,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:55,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:55,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:58:55,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:58:55,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:55,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055272356] [2025-03-16 19:58:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055272356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:56,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:58:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676181189] [2025-03-16 19:58:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:58:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:56,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:58:56,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:56,074 INFO L87 Difference]: Start difference. First operand 2683 states and 4795 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:56,282 INFO L93 Difference]: Finished difference Result 3270 states and 5681 transitions. [2025-03-16 19:58:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-16 19:58:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:56,293 INFO L225 Difference]: With dead ends: 3270 [2025-03-16 19:58:56,294 INFO L226 Difference]: Without dead ends: 2716 [2025-03-16 19:58:56,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:58:56,297 INFO L435 NwaCegarLoop]: 4081 mSDtfsCounter, 4179 mSDsluCounter, 8107 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4189 SdHoareTripleChecker+Valid, 12188 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:56,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4189 Valid, 12188 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:58:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2025-03-16 19:58:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2683. [2025-03-16 19:58:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 2585 states have (on average 1.8011605415860734) internal successors, (4656), 2594 states have internal predecessors, (4656), 60 states have call successors, (60), 31 states have call predecessors, (60), 36 states have return successors, (74), 61 states have call predecessors, (74), 58 states have call successors, (74) [2025-03-16 19:58:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4790 transitions. [2025-03-16 19:58:56,388 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4790 transitions. Word has length 62 [2025-03-16 19:58:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:56,389 INFO L471 AbstractCegarLoop]: Abstraction has 2683 states and 4790 transitions. [2025-03-16 19:58:56,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4790 transitions. [2025-03-16 19:58:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:58:56,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:56,390 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] [2025-03-16 19:58:56,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:58:56,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:56,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:56,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1515375522, now seen corresponding path program 1 times [2025-03-16 19:58:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:56,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614224987] [2025-03-16 19:58:56,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:56,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:58:56,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:58:56,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:56,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:58:56,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:56,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614224987] [2025-03-16 19:58:56,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614224987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:56,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:58:56,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:58:56,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493387919] [2025-03-16 19:58:56,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:56,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:58:56,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:56,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:58:56,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:58:56,455 INFO L87 Difference]: Start difference. First operand 2683 states and 4790 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:56,654 INFO L93 Difference]: Finished difference Result 3739 states and 6382 transitions. [2025-03-16 19:58:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:56,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-16 19:58:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:56,666 INFO L225 Difference]: With dead ends: 3739 [2025-03-16 19:58:56,666 INFO L226 Difference]: Without dead ends: 3186 [2025-03-16 19:58:56,669 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-16 19:58:56,670 INFO L435 NwaCegarLoop]: 4282 mSDtfsCounter, 4261 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4261 SdHoareTripleChecker+Valid, 8503 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:56,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4261 Valid, 8503 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:58:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2025-03-16 19:58:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3181. [2025-03-16 19:58:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 2993 states have (on average 1.7474106247911794) internal successors, (5230), 3013 states have internal predecessors, (5230), 114 states have call successors, (114), 61 states have call predecessors, (114), 72 states have return successors, (141), 110 states have call predecessors, (141), 112 states have call successors, (141) [2025-03-16 19:58:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 5485 transitions. [2025-03-16 19:58:56,782 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 5485 transitions. Word has length 62 [2025-03-16 19:58:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:56,782 INFO L471 AbstractCegarLoop]: Abstraction has 3181 states and 5485 transitions. [2025-03-16 19:58:56,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 5485 transitions. [2025-03-16 19:58:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:58:56,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:56,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:56,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:58:56,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:56,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -284358998, now seen corresponding path program 1 times [2025-03-16 19:58:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341132845] [2025-03-16 19:58:56,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:56,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:58:56,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:58:56,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:56,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 19:58:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341132845] [2025-03-16 19:58:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341132845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:58:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231386046] [2025-03-16 19:58:56,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:58:56,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:58:56,836 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-16 19:58:56,838 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-16 19:58:56,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:58:56,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:58:56,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:56,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:56,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:58:56,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:58:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 19:58:56,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:58:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231386046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:56,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:58:56,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:58:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735087112] [2025-03-16 19:58:56,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:56,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:58:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:56,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:58:56,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:56,983 INFO L87 Difference]: Start difference. First operand 3181 states and 5485 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 19:58:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:57,118 INFO L93 Difference]: Finished difference Result 5244 states and 8495 transitions. [2025-03-16 19:58:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:58:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2025-03-16 19:58:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:57,140 INFO L225 Difference]: With dead ends: 5244 [2025-03-16 19:58:57,140 INFO L226 Difference]: Without dead ends: 4193 [2025-03-16 19:58:57,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:57,146 INFO L435 NwaCegarLoop]: 4138 mSDtfsCounter, 4101 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4101 SdHoareTripleChecker+Valid, 4299 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-16 19:58:57,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4101 Valid, 4299 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:58:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2025-03-16 19:58:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 4179. [2025-03-16 19:58:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4179 states, 3817 states have (on average 1.6822111605973278) internal successors, (6421), 3854 states have internal predecessors, (6421), 216 states have call successors, (216), 121 states have call predecessors, (216), 144 states have return successors, (269), 207 states have call predecessors, (269), 214 states have call successors, (269) [2025-03-16 19:58:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 6906 transitions. [2025-03-16 19:58:57,358 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 6906 transitions. Word has length 100 [2025-03-16 19:58:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:57,358 INFO L471 AbstractCegarLoop]: Abstraction has 4179 states and 6906 transitions. [2025-03-16 19:58:57,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 19:58:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 6906 transitions. [2025-03-16 19:58:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:58:57,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:57,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:57,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:58:57,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:58:57,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 632390474, now seen corresponding path program 1 times [2025-03-16 19:58:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628768265] [2025-03-16 19:58:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:57,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:58:57,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:58:57,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:57,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:58:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628768265] [2025-03-16 19:58:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628768265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:58:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609037426] [2025-03-16 19:58:57,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:58:57,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:58:57,641 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-16 19:58:57,643 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-16 19:58:57,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:58:57,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:58:57,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:57,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:57,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:58:57,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:58:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 19:58:57,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:58:57,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609037426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:57,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:58:57,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 19:58:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141601483] [2025-03-16 19:58:57,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:57,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:58:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:57,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:58:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:57,760 INFO L87 Difference]: Start difference. First operand 4179 states and 6906 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 19:58:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:57,891 INFO L93 Difference]: Finished difference Result 8176 states and 12700 transitions. [2025-03-16 19:58:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:58:57,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2025-03-16 19:58:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:57,913 INFO L225 Difference]: With dead ends: 8176 [2025-03-16 19:58:57,913 INFO L226 Difference]: Without dead ends: 6127 [2025-03-16 19:58:57,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:57,922 INFO L435 NwaCegarLoop]: 4138 mSDtfsCounter, 4106 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4299 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-16 19:58:57,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4299 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:58:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2025-03-16 19:58:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 6103. [2025-03-16 19:58:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6103 states, 5407 states have (on average 1.611799519141853) internal successors, (8715), 5478 states have internal predecessors, (8715), 406 states have call successors, (406), 241 states have call predecessors, (406), 288 states have return successors, (511), 387 states have call predecessors, (511), 404 states have call successors, (511) [2025-03-16 19:58:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 9632 transitions. [2025-03-16 19:58:58,122 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 9632 transitions. Word has length 100 [2025-03-16 19:58:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:58,122 INFO L471 AbstractCegarLoop]: Abstraction has 6103 states and 9632 transitions. [2025-03-16 19:58:58,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 19:58:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 9632 transitions. [2025-03-16 19:58:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:58:58,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:58,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:58,133 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-16 19:58:58,331 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,SelfDestructingSolverStorable8 [2025-03-16 19:58:58,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:58,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash 528607914, now seen corresponding path program 1 times [2025-03-16 19:58:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:58,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991691304] [2025-03-16 19:58:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:58,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:58:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:58:58,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:58,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 19:58:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:58,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991691304] [2025-03-16 19:58:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991691304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:58:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572830534] [2025-03-16 19:58:58,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:58,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:58:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:58:58,392 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-16 19:58:58,393 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-16 19:58:58,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:58:58,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:58:58,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:58,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:58,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:58:58,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:58:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:58:58,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:58:58,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572830534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:58,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:58:58,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:58:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526318031] [2025-03-16 19:58:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:58,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:58:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:58,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:58:58,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:58,501 INFO L87 Difference]: Start difference. First operand 6103 states and 9632 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:58:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:58,782 INFO L93 Difference]: Finished difference Result 13647 states and 20577 transitions. [2025-03-16 19:58:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:58:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2025-03-16 19:58:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:58,815 INFO L225 Difference]: With dead ends: 13647 [2025-03-16 19:58:58,815 INFO L226 Difference]: Without dead ends: 9675 [2025-03-16 19:58:58,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:58,828 INFO L435 NwaCegarLoop]: 4285 mSDtfsCounter, 145 mSDsluCounter, 4135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 8420 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-16 19:58:58,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 8420 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:58:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9675 states. [2025-03-16 19:58:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9675 to 9675. [2025-03-16 19:58:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9675 states, 8356 states have (on average 1.542963140258497) internal successors, (12893), 8476 states have internal predecessors, (12893), 755 states have call successors, (755), 467 states have call predecessors, (755), 562 states have return successors, (1074), 739 states have call predecessors, (1074), 753 states have call successors, (1074) [2025-03-16 19:58:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9675 states to 9675 states and 14722 transitions. [2025-03-16 19:58:59,159 INFO L78 Accepts]: Start accepts. Automaton has 9675 states and 14722 transitions. Word has length 100 [2025-03-16 19:58:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:58:59,159 INFO L471 AbstractCegarLoop]: Abstraction has 9675 states and 14722 transitions. [2025-03-16 19:58:59,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:58:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 9675 states and 14722 transitions. [2025-03-16 19:58:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:58:59,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:58:59,175 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:58:59,181 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-16 19:58:59,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:58:59,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:58:59,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:58:59,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1243489649, now seen corresponding path program 1 times [2025-03-16 19:58:59,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:58:59,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139950454] [2025-03-16 19:58:59,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:58:59,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:58:59,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:58:59,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:59,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 19:58:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:58:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139950454] [2025-03-16 19:58:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139950454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:58:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315980127] [2025-03-16 19:58:59,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:58:59,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:58:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:58:59,449 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-16 19:58:59,450 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-16 19:58:59,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:58:59,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:58:59,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:58:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:58:59,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:58:59,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:58:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 19:58:59,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:58:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315980127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:58:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:58:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:58:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479216443] [2025-03-16 19:58:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:58:59,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:58:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:58:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:58:59,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:59,712 INFO L87 Difference]: Start difference. First operand 9675 states and 14722 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-16 19:58:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:59,940 INFO L93 Difference]: Finished difference Result 15529 states and 23286 transitions. [2025-03-16 19:58:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:58:59,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 145 [2025-03-16 19:58:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:59,969 INFO L225 Difference]: With dead ends: 15529 [2025-03-16 19:58:59,970 INFO L226 Difference]: Without dead ends: 9331 [2025-03-16 19:58:59,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:58:59,990 INFO L435 NwaCegarLoop]: 4135 mSDtfsCounter, 4079 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4166 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-16 19:58:59,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4166 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:58:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9331 states. [2025-03-16 19:59:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9331 to 7863. [2025-03-16 19:59:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7863 states, 6896 states have (on average 1.534947795823666) internal successors, (10585), 6946 states have internal predecessors, (10585), 563 states have call successors, (563), 371 states have call predecessors, (563), 402 states have return successors, (700), 549 states have call predecessors, (700), 561 states have call successors, (700) [2025-03-16 19:59:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7863 states to 7863 states and 11848 transitions. [2025-03-16 19:59:00,372 INFO L78 Accepts]: Start accepts. Automaton has 7863 states and 11848 transitions. Word has length 145 [2025-03-16 19:59:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:00,373 INFO L471 AbstractCegarLoop]: Abstraction has 7863 states and 11848 transitions. [2025-03-16 19:59:00,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-16 19:59:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7863 states and 11848 transitions. [2025-03-16 19:59:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:59:00,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:00,382 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:00,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 19:59:00,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:00,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:00,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash 549397302, now seen corresponding path program 1 times [2025-03-16 19:59:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:00,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918557102] [2025-03-16 19:59:00,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:00,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:59:00,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:59:00,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:00,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 19:59:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:00,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918557102] [2025-03-16 19:59:00,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918557102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:00,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506576859] [2025-03-16 19:59:00,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:00,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:00,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:00,665 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-16 19:59:00,667 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-16 19:59:00,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:59:00,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:59:00,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:00,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:00,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:59:00,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 19:59:00,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506576859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:00,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:00,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063929048] [2025-03-16 19:59:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:00,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:00,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:00,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:00,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:00,839 INFO L87 Difference]: Start difference. First operand 7863 states and 11848 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 19:59:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:01,231 INFO L93 Difference]: Finished difference Result 14165 states and 20738 transitions. [2025-03-16 19:59:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 145 [2025-03-16 19:59:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:01,262 INFO L225 Difference]: With dead ends: 14165 [2025-03-16 19:59:01,263 INFO L226 Difference]: Without dead ends: 8435 [2025-03-16 19:59:01,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:01,281 INFO L435 NwaCegarLoop]: 4134 mSDtfsCounter, 4093 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4093 SdHoareTripleChecker+Valid, 4164 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-16 19:59:01,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4093 Valid, 4164 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2025-03-16 19:59:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 8435. [2025-03-16 19:59:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8435 states, 7412 states have (on average 1.4896114409066379) internal successors, (11041), 7462 states have internal predecessors, (11041), 577 states have call successors, (577), 413 states have call predecessors, (577), 444 states have return successors, (714), 563 states have call predecessors, (714), 575 states have call successors, (714) [2025-03-16 19:59:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8435 states to 8435 states and 12332 transitions. [2025-03-16 19:59:01,637 INFO L78 Accepts]: Start accepts. Automaton has 8435 states and 12332 transitions. Word has length 145 [2025-03-16 19:59:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:01,638 INFO L471 AbstractCegarLoop]: Abstraction has 8435 states and 12332 transitions. [2025-03-16 19:59:01,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 19:59:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8435 states and 12332 transitions. [2025-03-16 19:59:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:59:01,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:01,646 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, 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] [2025-03-16 19:59:01,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 19:59:01,851 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,SelfDestructingSolverStorable11 [2025-03-16 19:59:01,851 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:01,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1105401243, now seen corresponding path program 1 times [2025-03-16 19:59:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:01,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625024109] [2025-03-16 19:59:01,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:01,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:01,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:59:01,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:59:01,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:01,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 19:59:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625024109] [2025-03-16 19:59:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625024109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130877816] [2025-03-16 19:59:01,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:01,915 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-16 19:59:01,916 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-16 19:59:01,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:59:02,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:59:02,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:02,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:02,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:59:02,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 19:59:02,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130877816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:02,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:02,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628395912] [2025-03-16 19:59:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:02,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:02,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:02,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:02,044 INFO L87 Difference]: Start difference. First operand 8435 states and 12332 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:59:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:02,311 INFO L93 Difference]: Finished difference Result 13794 states and 19408 transitions. [2025-03-16 19:59:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:02,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 145 [2025-03-16 19:59:02,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:02,339 INFO L225 Difference]: With dead ends: 13794 [2025-03-16 19:59:02,339 INFO L226 Difference]: Without dead ends: 8965 [2025-03-16 19:59:02,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:02,352 INFO L435 NwaCegarLoop]: 4173 mSDtfsCounter, 4074 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 4337 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-16 19:59:02,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 4337 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2025-03-16 19:59:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8895. [2025-03-16 19:59:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8895 states, 7844 states have (on average 1.464176440591535) internal successors, (11485), 7894 states have internal predecessors, (11485), 577 states have call successors, (577), 441 states have call predecessors, (577), 472 states have return successors, (742), 563 states have call predecessors, (742), 575 states have call successors, (742) [2025-03-16 19:59:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 12804 transitions. [2025-03-16 19:59:02,619 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 12804 transitions. Word has length 145 [2025-03-16 19:59:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:02,619 INFO L471 AbstractCegarLoop]: Abstraction has 8895 states and 12804 transitions. [2025-03-16 19:59:02,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:59:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 12804 transitions. [2025-03-16 19:59:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 19:59:02,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:02,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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:02,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 19:59:02,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:02,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:02,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1370075604, now seen corresponding path program 1 times [2025-03-16 19:59:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663709037] [2025-03-16 19:59:02,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:02,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 19:59:02,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 19:59:02,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:02,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 19:59:02,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:02,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663709037] [2025-03-16 19:59:02,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663709037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:02,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693112607] [2025-03-16 19:59:02,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:02,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:02,892 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-16 19:59:02,894 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-16 19:59:02,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 19:59:02,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 19:59:02,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:02,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:02,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:59:02,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:59:03,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:03,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693112607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:03,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:03,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:03,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305350368] [2025-03-16 19:59:03,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:03,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:03,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:03,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:03,017 INFO L87 Difference]: Start difference. First operand 8895 states and 12804 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:03,313 INFO L93 Difference]: Finished difference Result 14843 states and 20758 transitions. [2025-03-16 19:59:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 146 [2025-03-16 19:59:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:03,342 INFO L225 Difference]: With dead ends: 14843 [2025-03-16 19:59:03,342 INFO L226 Difference]: Without dead ends: 11509 [2025-03-16 19:59:03,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:03,349 INFO L435 NwaCegarLoop]: 4265 mSDtfsCounter, 134 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 8396 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:03,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 8396 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11509 states. [2025-03-16 19:59:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11509 to 11505. [2025-03-16 19:59:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11505 states, 10046 states have (on average 1.4293251045192117) internal successors, (14359), 10118 states have internal predecessors, (14359), 801 states have call successors, (801), 609 states have call predecessors, (801), 656 states have return successors, (1150), 781 states have call predecessors, (1150), 799 states have call successors, (1150) [2025-03-16 19:59:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11505 states to 11505 states and 16310 transitions. [2025-03-16 19:59:03,674 INFO L78 Accepts]: Start accepts. Automaton has 11505 states and 16310 transitions. Word has length 146 [2025-03-16 19:59:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:03,674 INFO L471 AbstractCegarLoop]: Abstraction has 11505 states and 16310 transitions. [2025-03-16 19:59:03,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 11505 states and 16310 transitions. [2025-03-16 19:59:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 19:59:03,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:03,683 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:03,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 19:59:03,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:03,884 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:03,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1974183128, now seen corresponding path program 1 times [2025-03-16 19:59:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469814864] [2025-03-16 19:59:03,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:03,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:59:03,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:59:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-16 19:59:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469814864] [2025-03-16 19:59:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469814864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960536254] [2025-03-16 19:59:03,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:03,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:03,953 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-16 19:59:03,955 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-16 19:59:04,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:59:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:59:04,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:04,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:04,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:59:04,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 19:59:04,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:04,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960536254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:04,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:04,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592294038] [2025-03-16 19:59:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:04,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:04,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:04,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:04,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:04,081 INFO L87 Difference]: Start difference. First operand 11505 states and 16310 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:59:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:04,605 INFO L93 Difference]: Finished difference Result 29311 states and 40322 transitions. [2025-03-16 19:59:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2025-03-16 19:59:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:04,667 INFO L225 Difference]: With dead ends: 29311 [2025-03-16 19:59:04,668 INFO L226 Difference]: Without dead ends: 19943 [2025-03-16 19:59:04,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:04,692 INFO L435 NwaCegarLoop]: 4173 mSDtfsCounter, 4097 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4097 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:04,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4097 Valid, 4335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19943 states. [2025-03-16 19:59:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19943 to 19475. [2025-03-16 19:59:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19475 states, 16722 states have (on average 1.3701112307140295) internal successors, (22911), 16864 states have internal predecessors, (22911), 1519 states have call successors, (1519), 1137 states have call predecessors, (1519), 1232 states have return successors, (2698), 1481 states have call predecessors, (2698), 1517 states have call successors, (2698) [2025-03-16 19:59:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19475 states to 19475 states and 27128 transitions. [2025-03-16 19:59:05,758 INFO L78 Accepts]: Start accepts. Automaton has 19475 states and 27128 transitions. Word has length 147 [2025-03-16 19:59:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:05,759 INFO L471 AbstractCegarLoop]: Abstraction has 19475 states and 27128 transitions. [2025-03-16 19:59:05,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:59:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19475 states and 27128 transitions. [2025-03-16 19:59:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 19:59:05,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:05,782 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:05,789 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-16 19:59:05,982 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,SelfDestructingSolverStorable14 [2025-03-16 19:59:05,984 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2111811973, now seen corresponding path program 1 times [2025-03-16 19:59:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113459029] [2025-03-16 19:59:05,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:05,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:59:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:59:05,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-16 19:59:06,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:06,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113459029] [2025-03-16 19:59:06,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113459029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:06,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455942111] [2025-03-16 19:59:06,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:06,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:06,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:06,061 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-16 19:59:06,063 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-16 19:59:06,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:59:06,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:59:06,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:06,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:06,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:59:06,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 19:59:06,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455942111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:06,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298534186] [2025-03-16 19:59:06,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:06,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:06,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:06,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:06,218 INFO L87 Difference]: Start difference. First operand 19475 states and 27128 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:06,923 INFO L93 Difference]: Finished difference Result 37851 states and 52385 transitions. [2025-03-16 19:59:06,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:06,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 147 [2025-03-16 19:59:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:06,987 INFO L225 Difference]: With dead ends: 37851 [2025-03-16 19:59:06,988 INFO L226 Difference]: Without dead ends: 20523 [2025-03-16 19:59:07,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:07,015 INFO L435 NwaCegarLoop]: 4137 mSDtfsCounter, 4096 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4096 SdHoareTripleChecker+Valid, 4166 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-16 19:59:07,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4096 Valid, 4166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20523 states. [2025-03-16 19:59:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20523 to 19475. [2025-03-16 19:59:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19475 states, 16722 states have (on average 1.34044970697285) internal successors, (22415), 16864 states have internal predecessors, (22415), 1519 states have call successors, (1519), 1137 states have call predecessors, (1519), 1232 states have return successors, (2542), 1481 states have call predecessors, (2542), 1517 states have call successors, (2542) [2025-03-16 19:59:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19475 states to 19475 states and 26476 transitions. [2025-03-16 19:59:07,780 INFO L78 Accepts]: Start accepts. Automaton has 19475 states and 26476 transitions. Word has length 147 [2025-03-16 19:59:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:07,780 INFO L471 AbstractCegarLoop]: Abstraction has 19475 states and 26476 transitions. [2025-03-16 19:59:07,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 19475 states and 26476 transitions. [2025-03-16 19:59:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 19:59:07,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:07,800 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:07,807 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-16 19:59:08,000 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,SelfDestructingSolverStorable15 [2025-03-16 19:59:08,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:08,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash -346624568, now seen corresponding path program 1 times [2025-03-16 19:59:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117958445] [2025-03-16 19:59:08,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:08,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:59:08,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:59:08,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:08,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-16 19:59:08,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:08,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117958445] [2025-03-16 19:59:08,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117958445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:08,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280512327] [2025-03-16 19:59:08,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:08,063 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-16 19:59:08,065 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-16 19:59:08,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:59:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:59:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:08,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:08,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:59:08,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 19:59:08,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280512327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:08,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:08,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078459091] [2025-03-16 19:59:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:08,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:08,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:08,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:08,183 INFO L87 Difference]: Start difference. First operand 19475 states and 26476 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:08,799 INFO L93 Difference]: Finished difference Result 32863 states and 43722 transitions. [2025-03-16 19:59:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:08,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 147 [2025-03-16 19:59:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:08,871 INFO L225 Difference]: With dead ends: 32863 [2025-03-16 19:59:08,871 INFO L226 Difference]: Without dead ends: 19479 [2025-03-16 19:59:08,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:08,899 INFO L435 NwaCegarLoop]: 4267 mSDtfsCounter, 147 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 8391 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:08,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 8391 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19479 states. [2025-03-16 19:59:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19479 to 19475. [2025-03-16 19:59:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19475 states, 16722 states have (on average 1.3332735318741777) internal successors, (22295), 16864 states have internal predecessors, (22295), 1519 states have call successors, (1519), 1137 states have call predecessors, (1519), 1232 states have return successors, (2422), 1481 states have call predecessors, (2422), 1517 states have call successors, (2422) [2025-03-16 19:59:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19475 states to 19475 states and 26236 transitions. [2025-03-16 19:59:09,728 INFO L78 Accepts]: Start accepts. Automaton has 19475 states and 26236 transitions. Word has length 147 [2025-03-16 19:59:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:09,728 INFO L471 AbstractCegarLoop]: Abstraction has 19475 states and 26236 transitions. [2025-03-16 19:59:09,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 19475 states and 26236 transitions. [2025-03-16 19:59:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 19:59:09,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:09,742 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, 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] [2025-03-16 19:59:09,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 19:59:09,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 19:59:09,946 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:09,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1538600343, now seen corresponding path program 1 times [2025-03-16 19:59:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:09,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089343470] [2025-03-16 19:59:09,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:09,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:09,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:59:09,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:59:09,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:09,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-16 19:59:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089343470] [2025-03-16 19:59:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089343470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:09,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:59:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722398599] [2025-03-16 19:59:09,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:09,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:09,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:09,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:09,974 INFO L87 Difference]: Start difference. First operand 19475 states and 26236 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 19:59:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:10,403 INFO L93 Difference]: Finished difference Result 32861 states and 43365 transitions. [2025-03-16 19:59:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:10,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 147 [2025-03-16 19:59:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:10,463 INFO L225 Difference]: With dead ends: 32861 [2025-03-16 19:59:10,464 INFO L226 Difference]: Without dead ends: 15521 [2025-03-16 19:59:10,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:10,497 INFO L435 NwaCegarLoop]: 4132 mSDtfsCounter, 171 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 8089 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:10,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 8089 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15521 states. [2025-03-16 19:59:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15521 to 15521. [2025-03-16 19:59:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15521 states, 13418 states have (on average 1.3561633626471903) internal successors, (18197), 13524 states have internal predecessors, (18197), 1157 states have call successors, (1157), 873 states have call predecessors, (1157), 944 states have return successors, (1754), 1127 states have call predecessors, (1754), 1155 states have call successors, (1754) [2025-03-16 19:59:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15521 states to 15521 states and 21108 transitions. [2025-03-16 19:59:11,388 INFO L78 Accepts]: Start accepts. Automaton has 15521 states and 21108 transitions. Word has length 147 [2025-03-16 19:59:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:11,389 INFO L471 AbstractCegarLoop]: Abstraction has 15521 states and 21108 transitions. [2025-03-16 19:59:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 19:59:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15521 states and 21108 transitions. [2025-03-16 19:59:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 19:59:11,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:11,399 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, 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] [2025-03-16 19:59:11,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:59:11,399 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:11,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 786898497, now seen corresponding path program 1 times [2025-03-16 19:59:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706074891] [2025-03-16 19:59:11,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:11,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:59:11,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:59:11,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:11,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-16 19:59:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706074891] [2025-03-16 19:59:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706074891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938881534] [2025-03-16 19:59:11,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:11,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:11,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:11,465 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:11,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 19:59:11,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:59:11,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:59:11,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:11,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:11,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:59:11,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 19:59:11,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938881534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:11,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:11,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713302693] [2025-03-16 19:59:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:11,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:11,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:11,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:11,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:11,606 INFO L87 Difference]: Start difference. First operand 15521 states and 21108 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:59:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:12,503 INFO L93 Difference]: Finished difference Result 29125 states and 38564 transitions. [2025-03-16 19:59:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:12,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 148 [2025-03-16 19:59:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:12,576 INFO L225 Difference]: With dead ends: 29125 [2025-03-16 19:59:12,576 INFO L226 Difference]: Without dead ends: 15741 [2025-03-16 19:59:12,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:12,607 INFO L435 NwaCegarLoop]: 4151 mSDtfsCounter, 4094 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4094 SdHoareTripleChecker+Valid, 4303 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-16 19:59:12,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4094 Valid, 4303 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15741 states. [2025-03-16 19:59:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15741 to 15521. [2025-03-16 19:59:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15521 states, 13418 states have (on average 1.3488597406468923) internal successors, (18099), 13524 states have internal predecessors, (18099), 1157 states have call successors, (1157), 873 states have call predecessors, (1157), 944 states have return successors, (1754), 1127 states have call predecessors, (1754), 1155 states have call successors, (1754) [2025-03-16 19:59:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15521 states to 15521 states and 21010 transitions. [2025-03-16 19:59:13,380 INFO L78 Accepts]: Start accepts. Automaton has 15521 states and 21010 transitions. Word has length 148 [2025-03-16 19:59:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:13,381 INFO L471 AbstractCegarLoop]: Abstraction has 15521 states and 21010 transitions. [2025-03-16 19:59:13,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:59:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15521 states and 21010 transitions. [2025-03-16 19:59:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:59:13,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:13,390 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:13,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 19:59:13,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:13,595 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:13,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1238269288, now seen corresponding path program 1 times [2025-03-16 19:59:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:13,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436816302] [2025-03-16 19:59:13,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:13,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:59:13,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:59:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:13,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 19:59:13,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:13,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436816302] [2025-03-16 19:59:13,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436816302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:13,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011227998] [2025-03-16 19:59:13,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:13,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:13,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:13,641 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:13,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 19:59:13,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:59:13,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:59:13,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:13,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:13,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:59:13,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:59:13,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011227998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126487711] [2025-03-16 19:59:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:13,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:13,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:13,772 INFO L87 Difference]: Start difference. First operand 15521 states and 21010 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:14,219 INFO L93 Difference]: Finished difference Result 24073 states and 32686 transitions. [2025-03-16 19:59:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:14,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 151 [2025-03-16 19:59:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:14,276 INFO L225 Difference]: With dead ends: 24073 [2025-03-16 19:59:14,276 INFO L226 Difference]: Without dead ends: 15561 [2025-03-16 19:59:14,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:14,298 INFO L435 NwaCegarLoop]: 4275 mSDtfsCounter, 129 mSDsluCounter, 4115 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 8390 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:14,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 8390 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2025-03-16 19:59:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 15521. [2025-03-16 19:59:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15521 states, 13418 states have (on average 1.3309733194216724) internal successors, (17859), 13524 states have internal predecessors, (17859), 1157 states have call successors, (1157), 873 states have call predecessors, (1157), 944 states have return successors, (1754), 1127 states have call predecessors, (1754), 1155 states have call successors, (1754) [2025-03-16 19:59:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15521 states to 15521 states and 20770 transitions. [2025-03-16 19:59:14,854 INFO L78 Accepts]: Start accepts. Automaton has 15521 states and 20770 transitions. Word has length 151 [2025-03-16 19:59:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:14,855 INFO L471 AbstractCegarLoop]: Abstraction has 15521 states and 20770 transitions. [2025-03-16 19:59:14,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 15521 states and 20770 transitions. [2025-03-16 19:59:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 19:59:14,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:14,864 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, 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] [2025-03-16 19:59:14,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-16 19:59:15,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:15,069 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:15,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash 406970145, now seen corresponding path program 1 times [2025-03-16 19:59:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852604659] [2025-03-16 19:59:15,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:15,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 19:59:15,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 19:59:15,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:15,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-16 19:59:15,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852604659] [2025-03-16 19:59:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852604659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95594672] [2025-03-16 19:59:15,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:15,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:15,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 19:59:15,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 19:59:15,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 19:59:15,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:15,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:15,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:59:15,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:59:15,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:15,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95594672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:15,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:15,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 19:59:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241942269] [2025-03-16 19:59:15,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:15,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:15,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:15,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:15,284 INFO L87 Difference]: Start difference. First operand 15521 states and 20770 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:15,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:15,769 INFO L93 Difference]: Finished difference Result 24865 states and 33304 transitions. [2025-03-16 19:59:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:15,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 152 [2025-03-16 19:59:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:15,819 INFO L225 Difference]: With dead ends: 24865 [2025-03-16 19:59:15,819 INFO L226 Difference]: Without dead ends: 15565 [2025-03-16 19:59:15,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:15,841 INFO L435 NwaCegarLoop]: 4227 mSDtfsCounter, 107 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 8340 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:15,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 8340 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2025-03-16 19:59:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15521. [2025-03-16 19:59:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15521 states, 13418 states have (on average 1.3112982560739306) internal successors, (17595), 13524 states have internal predecessors, (17595), 1157 states have call successors, (1157), 873 states have call predecessors, (1157), 944 states have return successors, (1754), 1127 states have call predecessors, (1754), 1155 states have call successors, (1754) [2025-03-16 19:59:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15521 states to 15521 states and 20506 transitions. [2025-03-16 19:59:16,396 INFO L78 Accepts]: Start accepts. Automaton has 15521 states and 20506 transitions. Word has length 152 [2025-03-16 19:59:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:16,396 INFO L471 AbstractCegarLoop]: Abstraction has 15521 states and 20506 transitions. [2025-03-16 19:59:16,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 19:59:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 15521 states and 20506 transitions. [2025-03-16 19:59:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:59:16,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:16,405 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:16,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-16 19:59:16,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 19:59:16,605 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:16,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash 61352302, now seen corresponding path program 1 times [2025-03-16 19:59:16,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:16,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191854941] [2025-03-16 19:59:16,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:16,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:16,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:16,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:16,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-16 19:59:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191854941] [2025-03-16 19:59:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191854941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222485372] [2025-03-16 19:59:16,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:16,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:16,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:16,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-16 19:59:16,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:16,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:16,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:16,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:16,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:59:16,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-16 19:59:16,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222485372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:16,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 19:59:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55514896] [2025-03-16 19:59:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:16,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:16,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:16,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:59:16,833 INFO L87 Difference]: Start difference. First operand 15521 states and 20506 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:59:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:17,535 INFO L93 Difference]: Finished difference Result 23843 states and 31083 transitions. [2025-03-16 19:59:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 153 [2025-03-16 19:59:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:17,570 INFO L225 Difference]: With dead ends: 23843 [2025-03-16 19:59:17,570 INFO L226 Difference]: Without dead ends: 14222 [2025-03-16 19:59:17,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:59:17,584 INFO L435 NwaCegarLoop]: 4070 mSDtfsCounter, 4135 mSDsluCounter, 8090 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 12160 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:17,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 12160 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:59:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14222 states. [2025-03-16 19:59:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14222 to 10594. [2025-03-16 19:59:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10594 states, 9287 states have (on average 1.3413373532895445) internal successors, (12457), 9345 states have internal predecessors, (12457), 731 states have call successors, (731), 539 states have call predecessors, (731), 574 states have return successors, (1099), 711 states have call predecessors, (1099), 729 states have call successors, (1099) [2025-03-16 19:59:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10594 states to 10594 states and 14287 transitions. [2025-03-16 19:59:17,973 INFO L78 Accepts]: Start accepts. Automaton has 10594 states and 14287 transitions. Word has length 153 [2025-03-16 19:59:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:17,973 INFO L471 AbstractCegarLoop]: Abstraction has 10594 states and 14287 transitions. [2025-03-16 19:59:17,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:59:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 10594 states and 14287 transitions. [2025-03-16 19:59:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:59:17,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:17,978 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:17,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-16 19:59:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:18,179 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:18,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1222558865, now seen corresponding path program 1 times [2025-03-16 19:59:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:18,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544004810] [2025-03-16 19:59:18,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:18,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 19:59:18,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:18,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544004810] [2025-03-16 19:59:18,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544004810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:18,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332135590] [2025-03-16 19:59:18,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:18,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:18,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:18,226 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:18,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-16 19:59:18,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:18,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:18,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:18,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:18,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:59:18,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-16 19:59:18,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332135590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:18,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:18,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 19:59:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328291349] [2025-03-16 19:59:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:18,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:18,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:18,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:18,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:59:18,389 INFO L87 Difference]: Start difference. First operand 10594 states and 14287 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:59:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:18,877 INFO L93 Difference]: Finished difference Result 19051 states and 24703 transitions. [2025-03-16 19:59:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 153 [2025-03-16 19:59:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:18,921 INFO L225 Difference]: With dead ends: 19051 [2025-03-16 19:59:18,921 INFO L226 Difference]: Without dead ends: 10594 [2025-03-16 19:59:18,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:59:18,938 INFO L435 NwaCegarLoop]: 4068 mSDtfsCounter, 4133 mSDsluCounter, 8087 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4142 SdHoareTripleChecker+Valid, 12155 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4142 Valid, 12155 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:59:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10594 states. [2025-03-16 19:59:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10594 to 10594. [2025-03-16 19:59:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10594 states, 9287 states have (on average 1.321740066759987) internal successors, (12275), 9345 states have internal predecessors, (12275), 731 states have call successors, (731), 539 states have call predecessors, (731), 574 states have return successors, (1099), 711 states have call predecessors, (1099), 729 states have call successors, (1099) [2025-03-16 19:59:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10594 states to 10594 states and 14105 transitions. [2025-03-16 19:59:19,362 INFO L78 Accepts]: Start accepts. Automaton has 10594 states and 14105 transitions. Word has length 153 [2025-03-16 19:59:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:19,363 INFO L471 AbstractCegarLoop]: Abstraction has 10594 states and 14105 transitions. [2025-03-16 19:59:19,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:59:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 10594 states and 14105 transitions. [2025-03-16 19:59:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:59:19,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:19,368 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:19,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-16 19:59:19,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:19,569 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:19,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:19,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1925867918, now seen corresponding path program 1 times [2025-03-16 19:59:19,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:19,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544305235] [2025-03-16 19:59:19,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:19,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:19,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:19,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:19,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:19,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-16 19:59:19,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544305235] [2025-03-16 19:59:19,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544305235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171218363] [2025-03-16 19:59:19,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:19,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:19,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:19,614 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:19,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-16 19:59:19,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:19,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:19,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:19,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:19,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 19:59:19,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-16 19:59:19,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171218363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-16 19:59:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729793933] [2025-03-16 19:59:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:19,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:59:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:19,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:59:19,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:19,731 INFO L87 Difference]: Start difference. First operand 10594 states and 14105 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 19:59:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:20,212 INFO L93 Difference]: Finished difference Result 18099 states and 23451 transitions. [2025-03-16 19:59:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:20,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 153 [2025-03-16 19:59:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:20,246 INFO L225 Difference]: With dead ends: 18099 [2025-03-16 19:59:20,246 INFO L226 Difference]: Without dead ends: 9640 [2025-03-16 19:59:20,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 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-16 19:59:20,265 INFO L435 NwaCegarLoop]: 4126 mSDtfsCounter, 0 mSDsluCounter, 8247 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12373 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:20,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:59:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2025-03-16 19:59:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 9640. [2025-03-16 19:59:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9640 states, 8485 states have (on average 1.3212728344136713) internal successors, (11211), 8537 states have internal predecessors, (11211), 647 states have call successors, (647), 475 states have call predecessors, (647), 506 states have return successors, (893), 629 states have call predecessors, (893), 645 states have call successors, (893) [2025-03-16 19:59:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9640 states to 9640 states and 12751 transitions. [2025-03-16 19:59:20,642 INFO L78 Accepts]: Start accepts. Automaton has 9640 states and 12751 transitions. Word has length 153 [2025-03-16 19:59:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:20,642 INFO L471 AbstractCegarLoop]: Abstraction has 9640 states and 12751 transitions. [2025-03-16 19:59:20,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 19:59:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9640 states and 12751 transitions. [2025-03-16 19:59:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:59:20,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:20,646 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:20,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-16 19:59:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 19:59:20,847 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash 315776687, now seen corresponding path program 1 times [2025-03-16 19:59:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334184371] [2025-03-16 19:59:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:20,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:20,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:20,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:20,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 19:59:20,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334184371] [2025-03-16 19:59:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334184371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51689138] [2025-03-16 19:59:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:20,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:20,886 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:20,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-16 19:59:20,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:20,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:20,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:20,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:20,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 19:59:20,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-16 19:59:20,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51689138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-16 19:59:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548385260] [2025-03-16 19:59:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:59:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:20,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:59:20,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:20,996 INFO L87 Difference]: Start difference. First operand 9640 states and 12751 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 19:59:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:21,253 INFO L93 Difference]: Finished difference Result 15163 states and 19397 transitions. [2025-03-16 19:59:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:21,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 153 [2025-03-16 19:59:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:21,283 INFO L225 Difference]: With dead ends: 15163 [2025-03-16 19:59:21,283 INFO L226 Difference]: Without dead ends: 7658 [2025-03-16 19:59:21,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 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-16 19:59:21,294 INFO L435 NwaCegarLoop]: 4126 mSDtfsCounter, 0 mSDsluCounter, 8247 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12373 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:21,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2025-03-16 19:59:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 7658. [2025-03-16 19:59:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7658 states, 6815 states have (on average 1.3562729273661043) internal successors, (9243), 6855 states have internal predecessors, (9243), 471 states have call successors, (471), 339 states have call predecessors, (471), 370 states have return successors, (583), 465 states have call predecessors, (583), 469 states have call successors, (583) [2025-03-16 19:59:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 10297 transitions. [2025-03-16 19:59:21,555 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 10297 transitions. Word has length 153 [2025-03-16 19:59:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:21,555 INFO L471 AbstractCegarLoop]: Abstraction has 7658 states and 10297 transitions. [2025-03-16 19:59:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 19:59:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 10297 transitions. [2025-03-16 19:59:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:59:21,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:21,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:59:21,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-16 19:59:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:21,758 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1220808211, now seen corresponding path program 1 times [2025-03-16 19:59:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133838026] [2025-03-16 19:59:21,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:21,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:21,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:21,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:21,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 19:59:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133838026] [2025-03-16 19:59:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133838026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:59:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529762252] [2025-03-16 19:59:21,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:21,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:21,800 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:59:21,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-16 19:59:21,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:59:21,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:59:21,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:21,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:21,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 19:59:21,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:59:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 19:59:21,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:59:21,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529762252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:21,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:59:21,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-16 19:59:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329581343] [2025-03-16 19:59:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:21,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:59:21,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:21,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:59:21,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:59:21,911 INFO L87 Difference]: Start difference. First operand 7658 states and 10297 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 19:59:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:22,073 INFO L93 Difference]: Finished difference Result 10301 states and 13327 transitions. [2025-03-16 19:59:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 153 [2025-03-16 19:59:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:22,093 INFO L225 Difference]: With dead ends: 10301 [2025-03-16 19:59:22,093 INFO L226 Difference]: Without dead ends: 3801 [2025-03-16 19:59:22,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 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-16 19:59:22,100 INFO L435 NwaCegarLoop]: 4126 mSDtfsCounter, 0 mSDsluCounter, 8247 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12373 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:22,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2025-03-16 19:59:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3801. [2025-03-16 19:59:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3801 states, 3533 states have (on average 1.553920181149165) internal successors, (5490), 3546 states have internal predecessors, (5490), 153 states have call successors, (153), 106 states have call predecessors, (153), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2025-03-16 19:59:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 5802 transitions. [2025-03-16 19:59:22,246 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 5802 transitions. Word has length 153 [2025-03-16 19:59:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:22,246 INFO L471 AbstractCegarLoop]: Abstraction has 3801 states and 5802 transitions. [2025-03-16 19:59:22,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 19:59:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 5802 transitions. [2025-03-16 19:59:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 19:59:22,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:22,248 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:59:22,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-16 19:59:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:59:22,449 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1556698733, now seen corresponding path program 1 times [2025-03-16 19:59:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:22,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605178924] [2025-03-16 19:59:22,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:22,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 19:59:22,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 19:59:22,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:22,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-16 19:59:22,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:22,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605178924] [2025-03-16 19:59:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605178924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:22,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:22,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436842332] [2025-03-16 19:59:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:22,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:22,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:22,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:22,584 INFO L87 Difference]: Start difference. First operand 3801 states and 5802 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 19:59:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:22,840 INFO L93 Difference]: Finished difference Result 3803 states and 5803 transitions. [2025-03-16 19:59:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:59:22,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 186 [2025-03-16 19:59:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:22,860 INFO L225 Difference]: With dead ends: 3803 [2025-03-16 19:59:22,860 INFO L226 Difference]: Without dead ends: 3800 [2025-03-16 19:59:22,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:22,861 INFO L435 NwaCegarLoop]: 4307 mSDtfsCounter, 4276 mSDsluCounter, 8470 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4276 SdHoareTripleChecker+Valid, 12777 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:22,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4276 Valid, 12777 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:59:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2025-03-16 19:59:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3800. [2025-03-16 19:59:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 3533 states have (on average 1.5533540900084915) internal successors, (5488), 3545 states have internal predecessors, (5488), 152 states have call successors, (152), 106 states have call predecessors, (152), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2025-03-16 19:59:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5799 transitions. [2025-03-16 19:59:22,982 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5799 transitions. Word has length 186 [2025-03-16 19:59:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:22,984 INFO L471 AbstractCegarLoop]: Abstraction has 3800 states and 5799 transitions. [2025-03-16 19:59:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-16 19:59:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5799 transitions. [2025-03-16 19:59:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 19:59:22,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:22,987 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:59:22,987 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1643937477, now seen corresponding path program 1 times [2025-03-16 19:59:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047560786] [2025-03-16 19:59:22,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:22,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 19:59:23,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 19:59:23,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:23,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-16 19:59:23,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047560786] [2025-03-16 19:59:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047560786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:59:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225731929] [2025-03-16 19:59:23,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:23,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:23,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:23,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:23,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:23,023 INFO L87 Difference]: Start difference. First operand 3800 states and 5799 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-16 19:59:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:23,121 INFO L93 Difference]: Finished difference Result 4469 states and 6527 transitions. [2025-03-16 19:59:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 190 [2025-03-16 19:59:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:23,141 INFO L225 Difference]: With dead ends: 4469 [2025-03-16 19:59:23,141 INFO L226 Difference]: Without dead ends: 3802 [2025-03-16 19:59:23,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:23,143 INFO L435 NwaCegarLoop]: 4123 mSDtfsCounter, 0 mSDsluCounter, 4112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8235 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:23,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8235 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-03-16 19:59:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3802. [2025-03-16 19:59:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3535 states have (on average 1.5530410183875532) internal successors, (5490), 3547 states have internal predecessors, (5490), 152 states have call successors, (152), 106 states have call predecessors, (152), 113 states have return successors, (159), 149 states have call predecessors, (159), 151 states have call successors, (159) [2025-03-16 19:59:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5801 transitions. [2025-03-16 19:59:23,260 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5801 transitions. Word has length 190 [2025-03-16 19:59:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 3802 states and 5801 transitions. [2025-03-16 19:59:23,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-16 19:59:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5801 transitions. [2025-03-16 19:59:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-16 19:59:23,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:23,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:23,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:59:23,263 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:23,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1405949968, now seen corresponding path program 1 times [2025-03-16 19:59:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572221125] [2025-03-16 19:59:23,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:23,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-16 19:59:23,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-16 19:59:23,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:23,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:59:23,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 19:59:23,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-16 19:59:23,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-16 19:59:23,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:23,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 19:59:23,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 19:59:23,341 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 19:59:23,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-16 19:59:23,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-16 19:59:23,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:59:23,345 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-16 19:59:23,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 19:59:23,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 07:59:23 BoogieIcfgContainer [2025-03-16 19:59:23,456 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 19:59:23,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 19:59:23,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 19:59:23,457 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 19:59:23,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:58:53" (3/4) ... [2025-03-16 19:59:23,458 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 19:59:23,556 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 157. [2025-03-16 19:59:23,657 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 19:59:23,658 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 19:59:23,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 19:59:23,659 INFO L158 Benchmark]: Toolchain (without parser) took 39755.00ms. Allocated memory was 142.6MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 79.2MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 925.7MB. Max. memory is 16.1GB. [2025-03-16 19:59:23,659 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:59:23,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1972.66ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 79.2MB in the beginning and 88.9MB in the end (delta: -9.7MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2025-03-16 19:59:23,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 334.37ms. Allocated memory is still 226.5MB. Free memory was 88.9MB in the beginning and 67.5MB in the end (delta: 21.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2025-03-16 19:59:23,659 INFO L158 Benchmark]: Boogie Preprocessor took 532.81ms. Allocated memory is still 226.5MB. Free memory was 67.5MB in the beginning and 53.6MB in the end (delta: 13.9MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2025-03-16 19:59:23,659 INFO L158 Benchmark]: IcfgBuilder took 6332.48ms. Allocated memory was 226.5MB in the beginning and 562.0MB in the end (delta: 335.5MB). Free memory was 53.6MB in the beginning and 198.4MB in the end (delta: -144.8MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. [2025-03-16 19:59:23,659 INFO L158 Benchmark]: TraceAbstraction took 30373.39ms. Allocated memory was 562.0MB in the beginning and 3.8GB in the end (delta: 3.2GB). Free memory was 198.4MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 584.2MB. Max. memory is 16.1GB. [2025-03-16 19:59:23,660 INFO L158 Benchmark]: Witness Printer took 201.60ms. Allocated memory is still 3.8GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 19:59:23,660 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1972.66ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 79.2MB in the beginning and 88.9MB in the end (delta: -9.7MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 334.37ms. Allocated memory is still 226.5MB. Free memory was 88.9MB in the beginning and 67.5MB in the end (delta: 21.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 532.81ms. Allocated memory is still 226.5MB. Free memory was 67.5MB in the beginning and 53.6MB in the end (delta: 13.9MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * IcfgBuilder took 6332.48ms. Allocated memory was 226.5MB in the beginning and 562.0MB in the end (delta: 335.5MB). Free memory was 53.6MB in the beginning and 198.4MB in the end (delta: -144.8MB). Peak memory consumption was 395.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30373.39ms. Allocated memory was 562.0MB in the beginning and 3.8GB in the end (delta: 3.2GB). Free memory was 198.4MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 584.2MB. Max. memory is 16.1GB. * Witness Printer took 201.60ms. Allocated memory is still 3.8GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] int local ; [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_i = 1 [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] COND TRUE 1 [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET transmit2() [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11214] COND TRUE 1 [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11220] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11462] RET master() [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11278] token += 1 [L11279] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11620] RET activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11314] token += 1 [L11315] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] RET activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET transmit2() [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11206] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11228] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11242] CALL error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11173] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 11118]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2253 locations, 4241 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71799 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71728 mSDsluCounter, 253380 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136711 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2083 IncrementalHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 116669 mSDtfsCounter, 2083 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2654 GetRequests, 2559 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19475occurred in iteration=15, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 7199 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 6224 NumberOfCodeBlocks, 6224 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 5987 ConstructedInterpolants, 0 QuantifiedInterpolants, 7495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9152 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 2907/3293 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-16 19:59:23,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE