./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efc92bef151ce13307933930fbf12d828dd2fc0ecd03ad5da23928a5efb5fb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:46:03,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:46:03,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:46:03,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:46:03,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:46:03,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:46:03,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:46:03,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:46:03,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:46:03,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:46:03,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:46:03,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:46:03,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:46:03,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:46:03,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:46:03,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:46:03,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:03,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:46:03,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:46:03,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:46:03,825 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6efc92bef151ce13307933930fbf12d828dd2fc0ecd03ad5da23928a5efb5fb2 [2025-03-03 15:46:04,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:46:04,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:46:04,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:46:04,052 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:46:04,052 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:46:04,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c [2025-03-03 15:46:05,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2f5b10a/144d93abeaf94c299adf5ef8da66a62d/FLAG84d71fe78 [2025-03-03 15:46:05,742 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:46:05,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c [2025-03-03 15:46:05,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2f5b10a/144d93abeaf94c299adf5ef8da66a62d/FLAG84d71fe78 [2025-03-03 15:46:05,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2f5b10a/144d93abeaf94c299adf5ef8da66a62d [2025-03-03 15:46:05,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:46:05,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:46:05,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:05,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:46:05,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:46:05,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:05" (1/1) ... [2025-03-03 15:46:05,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ce3f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:05, skipping insertion in model container [2025-03-03 15:46:05,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:05" (1/1) ... [2025-03-03 15:46:05,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:46:07,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[377612,377625] [2025-03-03 15:46:07,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[383339,383352] [2025-03-03 15:46:07,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:07,224 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:46:07,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[377612,377625] [2025-03-03 15:46:07,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.03.cil-2.c[383339,383352] [2025-03-03 15:46:07,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:07,867 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:46:07,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07 WrapperNode [2025-03-03 15:46:07,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:07,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:07,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:46:07,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:46:07,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:07,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,223 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-03-03 15:46:08,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:08,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:46:08,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:46:08,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:46:08,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:46:08,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:46:08,790 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:46:08,790 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:46:08,790 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:46:08,791 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (1/1) ... [2025-03-03 15:46:08,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:08,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:08,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:46:08,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:46:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:46:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:46:08,838 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:46:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:46:08,838 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:46:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:46:08,838 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:46:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:46:08,838 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:46:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:46:08,839 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:46:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:46:08,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:46:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:46:08,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:46:08,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:46:08,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:46:08,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:46:14,930 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:46:14,930 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:46:14,931 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:46:14,931 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:46:14,932 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:46:14,932 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:46:14,932 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:46:15,236 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-03-03 15:46:15,238 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:46:15,304 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:46:15,304 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:46:15,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:15 BoogieIcfgContainer [2025-03-03 15:46:15,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:46:15,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:46:15,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:46:15,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:46:15,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:46:05" (1/3) ... [2025-03-03 15:46:15,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5942a558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:15, skipping insertion in model container [2025-03-03 15:46:15,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:07" (2/3) ... [2025-03-03 15:46:15,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5942a558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:15, skipping insertion in model container [2025-03-03 15:46:15,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:15" (3/3) ... [2025-03-03 15:46:15,320 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.03.cil-2.c [2025-03-03 15:46:15,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:46:15,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.03.cil-2.c that has 7 procedures, 2348 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-03 15:46:15,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:46:15,512 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;@4ab88b08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:46:15,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:46:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 15:46:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:15,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:15,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:15,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:15,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash -487538790, now seen corresponding path program 1 times [2025-03-03 15:46:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:15,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830019407] [2025-03-03 15:46:15,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:15,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:15,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:15,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830019407] [2025-03-03 15:46:15,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830019407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:15,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:15,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568519087] [2025-03-03 15:46:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:15,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:15,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:15,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:15,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:15,963 INFO L87 Difference]: Start difference. First operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:16,464 INFO L93 Difference]: Finished difference Result 4849 states and 8893 transitions. [2025-03-03 15:46:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:46:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:16,485 INFO L225 Difference]: With dead ends: 4849 [2025-03-03 15:46:16,485 INFO L226 Difference]: Without dead ends: 2442 [2025-03-03 15:46:16,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:16,497 INFO L435 NwaCegarLoop]: 4210 mSDtfsCounter, 4419 mSDsluCounter, 8509 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 12719 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:16,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 12719 Invalid, 301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-03 15:46:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2431. [2025-03-03 15:46:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8236279849183075) internal successors, (4353), 2390 states have internal predecessors, (4353), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-03 15:46:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4412 transitions. [2025-03-03 15:46:16,614 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4412 transitions. Word has length 79 [2025-03-03 15:46:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4412 transitions. [2025-03-03 15:46:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4412 transitions. [2025-03-03 15:46:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:16,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:16,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:16,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:46:16,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:16,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1778468956, now seen corresponding path program 1 times [2025-03-03 15:46:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:16,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663536021] [2025-03-03 15:46:16,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:16,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:16,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:16,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:16,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663536021] [2025-03-03 15:46:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663536021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:16,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:16,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466862539] [2025-03-03 15:46:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:16,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:16,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:16,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:16,797 INFO L87 Difference]: Start difference. First operand 2431 states and 4412 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:17,010 INFO L93 Difference]: Finished difference Result 2754 states and 4895 transitions. [2025-03-03 15:46:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:17,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:17,023 INFO L225 Difference]: With dead ends: 2754 [2025-03-03 15:46:17,023 INFO L226 Difference]: Without dead ends: 2455 [2025-03-03 15:46:17,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:17,026 INFO L435 NwaCegarLoop]: 4129 mSDtfsCounter, 4248 mSDsluCounter, 8193 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 12322 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:17,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 12322 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2025-03-03 15:46:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2431. [2025-03-03 15:46:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8227901131126938) internal successors, (4351), 2390 states have internal predecessors, (4351), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-03 15:46:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4410 transitions. [2025-03-03 15:46:17,125 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4410 transitions. Word has length 79 [2025-03-03 15:46:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:17,126 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4410 transitions. [2025-03-03 15:46:17,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4410 transitions. [2025-03-03 15:46:17,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:17,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:17,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:46:17,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:17,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash -396211141, now seen corresponding path program 1 times [2025-03-03 15:46:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:17,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523632159] [2025-03-03 15:46:17,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:17,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:17,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:17,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:17,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:17,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:17,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523632159] [2025-03-03 15:46:17,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523632159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:17,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:17,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403860230] [2025-03-03 15:46:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:17,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:17,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:17,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:17,280 INFO L87 Difference]: Start difference. First operand 2431 states and 4410 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:17,634 INFO L93 Difference]: Finished difference Result 2904 states and 5103 transitions. [2025-03-03 15:46:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:17,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:17,644 INFO L225 Difference]: With dead ends: 2904 [2025-03-03 15:46:17,645 INFO L226 Difference]: Without dead ends: 2605 [2025-03-03 15:46:17,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:17,648 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 4333 mSDsluCounter, 12733 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4344 SdHoareTripleChecker+Valid, 16982 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:17,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4344 Valid, 16982 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-03-03 15:46:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2570. [2025-03-03 15:46:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2507 states have (on average 1.8041483845233346) internal successors, (4523), 2511 states have internal predecessors, (4523), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-03 15:46:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 4609 transitions. [2025-03-03 15:46:17,712 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 4609 transitions. Word has length 79 [2025-03-03 15:46:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:17,713 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 4609 transitions. [2025-03-03 15:46:17,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 4609 transitions. [2025-03-03 15:46:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:17,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:17,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:17,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:46:17,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:17,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2090908634, now seen corresponding path program 1 times [2025-03-03 15:46:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:17,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410461247] [2025-03-03 15:46:17,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:17,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:17,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:17,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:17,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:17,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:17,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410461247] [2025-03-03 15:46:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410461247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236841808] [2025-03-03 15:46:17,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:17,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:17,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:17,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:17,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:17,850 INFO L87 Difference]: Start difference. First operand 2570 states and 4609 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:18,229 INFO L93 Difference]: Finished difference Result 3383 states and 5796 transitions. [2025-03-03 15:46:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:18,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:18,243 INFO L225 Difference]: With dead ends: 3383 [2025-03-03 15:46:18,243 INFO L226 Difference]: Without dead ends: 2945 [2025-03-03 15:46:18,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:18,247 INFO L435 NwaCegarLoop]: 4243 mSDtfsCounter, 4432 mSDsluCounter, 12710 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4447 SdHoareTripleChecker+Valid, 16953 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:18,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4447 Valid, 16953 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2025-03-03 15:46:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2851. [2025-03-03 15:46:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7723636363636364) internal successors, (4874), 2758 states have internal predecessors, (4874), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-03 15:46:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5016 transitions. [2025-03-03 15:46:18,314 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5016 transitions. Word has length 79 [2025-03-03 15:46:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:18,315 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5016 transitions. [2025-03-03 15:46:18,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5016 transitions. [2025-03-03 15:46:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:18,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:18,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:18,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:46:18,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:18,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash 924212315, now seen corresponding path program 1 times [2025-03-03 15:46:18,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:18,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621394647] [2025-03-03 15:46:18,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:18,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621394647] [2025-03-03 15:46:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621394647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263991727] [2025-03-03 15:46:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:18,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:18,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:18,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:18,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:18,457 INFO L87 Difference]: Start difference. First operand 2851 states and 5016 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:18,686 INFO L93 Difference]: Finished difference Result 3614 states and 6140 transitions. [2025-03-03 15:46:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:18,699 INFO L225 Difference]: With dead ends: 3614 [2025-03-03 15:46:18,699 INFO L226 Difference]: Without dead ends: 2895 [2025-03-03 15:46:18,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:18,703 INFO L435 NwaCegarLoop]: 4120 mSDtfsCounter, 4240 mSDsluCounter, 8174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 12294 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:18,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 12294 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-03-03 15:46:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2851. [2025-03-03 15:46:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7705454545454546) internal successors, (4869), 2758 states have internal predecessors, (4869), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-03 15:46:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5011 transitions. [2025-03-03 15:46:18,783 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5011 transitions. Word has length 79 [2025-03-03 15:46:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:18,783 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5011 transitions. [2025-03-03 15:46:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5011 transitions. [2025-03-03 15:46:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:18,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:18,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:18,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:46:18,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:18,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1025124282, now seen corresponding path program 1 times [2025-03-03 15:46:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827163471] [2025-03-03 15:46:18,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:18,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:18,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:18,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:18,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827163471] [2025-03-03 15:46:18,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827163471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:18,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:18,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419791303] [2025-03-03 15:46:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:18,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:18,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:18,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:18,882 INFO L87 Difference]: Start difference. First operand 2851 states and 5011 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:19,298 INFO L93 Difference]: Finished difference Result 4230 states and 7016 transitions. [2025-03-03 15:46:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:19,311 INFO L225 Difference]: With dead ends: 4230 [2025-03-03 15:46:19,311 INFO L226 Difference]: Without dead ends: 3511 [2025-03-03 15:46:19,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:19,314 INFO L435 NwaCegarLoop]: 4235 mSDtfsCounter, 4359 mSDsluCounter, 12687 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4374 SdHoareTripleChecker+Valid, 16922 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:19,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4374 Valid, 16922 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2025-03-03 15:46:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3419. [2025-03-03 15:46:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7192711550339717) internal successors, (5567), 3260 states have internal predecessors, (5567), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-03 15:46:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5841 transitions. [2025-03-03 15:46:19,413 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5841 transitions. Word has length 79 [2025-03-03 15:46:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:19,413 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5841 transitions. [2025-03-03 15:46:19,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5841 transitions. [2025-03-03 15:46:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:19,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:19,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:19,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:46:19,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1305474171, now seen corresponding path program 1 times [2025-03-03 15:46:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160307040] [2025-03-03 15:46:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:19,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:19,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:19,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:19,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:19,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160307040] [2025-03-03 15:46:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160307040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:19,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:19,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:19,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351622868] [2025-03-03 15:46:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:19,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:19,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:19,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:19,473 INFO L87 Difference]: Start difference. First operand 3419 states and 5841 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:19,716 INFO L93 Difference]: Finished difference Result 4764 states and 7820 transitions. [2025-03-03 15:46:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:19,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:19,728 INFO L225 Difference]: With dead ends: 4764 [2025-03-03 15:46:19,728 INFO L226 Difference]: Without dead ends: 3477 [2025-03-03 15:46:19,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:19,731 INFO L435 NwaCegarLoop]: 4115 mSDtfsCounter, 4236 mSDsluCounter, 8165 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4247 SdHoareTripleChecker+Valid, 12280 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:19,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4247 Valid, 12280 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:46:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2025-03-03 15:46:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3419. [2025-03-03 15:46:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7164916615194565) internal successors, (5558), 3260 states have internal predecessors, (5558), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-03 15:46:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5832 transitions. [2025-03-03 15:46:19,945 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5832 transitions. Word has length 79 [2025-03-03 15:46:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:19,949 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5832 transitions. [2025-03-03 15:46:19,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5832 transitions. [2025-03-03 15:46:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:46:19,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:19,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:19,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:46:19,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash -625144934, now seen corresponding path program 1 times [2025-03-03 15:46:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916170090] [2025-03-03 15:46:19,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:19,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:46:19,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:46:19,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:19,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916170090] [2025-03-03 15:46:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916170090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:20,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:46:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278725887] [2025-03-03 15:46:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:20,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:46:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:20,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:46:20,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:46:20,062 INFO L87 Difference]: Start difference. First operand 3419 states and 5832 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:20,332 INFO L93 Difference]: Finished difference Result 5943 states and 9555 transitions. [2025-03-03 15:46:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-03-03 15:46:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:20,355 INFO L225 Difference]: With dead ends: 5943 [2025-03-03 15:46:20,355 INFO L226 Difference]: Without dead ends: 4657 [2025-03-03 15:46:20,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:46:20,363 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4347 mSDsluCounter, 4317 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 8697 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:20,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 8697 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:46:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2025-03-03 15:46:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4648. [2025-03-03 15:46:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 4292 states have (on average 1.635135135135135) internal successors, (7018), 4343 states have internal predecessors, (7018), 206 states have call successors, (206), 108 states have call predecessors, (206), 148 states have return successors, (327), 204 states have call predecessors, (327), 206 states have call successors, (327) [2025-03-03 15:46:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 7551 transitions. [2025-03-03 15:46:20,510 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 7551 transitions. Word has length 79 [2025-03-03 15:46:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:20,511 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 7551 transitions. [2025-03-03 15:46:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 7551 transitions. [2025-03-03 15:46:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:46:20,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:20,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:20,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:46:20,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:20,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1353994054, now seen corresponding path program 1 times [2025-03-03 15:46:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:20,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789953208] [2025-03-03 15:46:20,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:20,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:20,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:20,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:20,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789953208] [2025-03-03 15:46:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789953208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880755478] [2025-03-03 15:46:20,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:20,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:20,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:20,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:20,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:46:20,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:20,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:20,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:20,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:20,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:20,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:46:20,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:20,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880755478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:20,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058470797] [2025-03-03 15:46:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:20,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:20,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:20,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:20,783 INFO L87 Difference]: Start difference. First operand 4648 states and 7551 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:20,952 INFO L93 Difference]: Finished difference Result 9587 states and 14641 transitions. [2025-03-03 15:46:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:20,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2025-03-03 15:46:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:20,974 INFO L225 Difference]: With dead ends: 9587 [2025-03-03 15:46:20,974 INFO L226 Difference]: Without dead ends: 7072 [2025-03-03 15:46:20,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:20,984 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:20,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4140 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7072 states. [2025-03-03 15:46:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7072 to 7016. [2025-03-03 15:46:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 6328 states have (on average 1.5619469026548674) internal successors, (9884), 6428 states have internal predecessors, (9884), 390 states have call successors, (390), 216 states have call predecessors, (390), 296 states have return successors, (625), 379 states have call predecessors, (625), 390 states have call successors, (625) [2025-03-03 15:46:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 10899 transitions. [2025-03-03 15:46:21,287 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 10899 transitions. Word has length 130 [2025-03-03 15:46:21,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:21,287 INFO L471 AbstractCegarLoop]: Abstraction has 7016 states and 10899 transitions. [2025-03-03 15:46:21,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 10899 transitions. [2025-03-03 15:46:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:46:21,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:21,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:21,304 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-03 15:46:21,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:21,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:21,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -928323724, now seen corresponding path program 1 times [2025-03-03 15:46:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295874228] [2025-03-03 15:46:21,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:21,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:21,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:21,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:21,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295874228] [2025-03-03 15:46:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295874228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354159534] [2025-03-03 15:46:21,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:21,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:21,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:21,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:46:21,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:21,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:21,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:21,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:21,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:21,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:46:21,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:21,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354159534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:21,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371171376] [2025-03-03 15:46:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:21,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:21,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:21,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:21,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:21,724 INFO L87 Difference]: Start difference. First operand 7016 states and 10899 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:22,194 INFO L93 Difference]: Finished difference Result 16649 states and 24697 transitions. [2025-03-03 15:46:22,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:22,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2025-03-03 15:46:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:22,267 INFO L225 Difference]: With dead ends: 16649 [2025-03-03 15:46:22,268 INFO L226 Difference]: Without dead ends: 11766 [2025-03-03 15:46:22,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:22,307 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:22,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11766 states. [2025-03-03 15:46:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11766 to 11656. [2025-03-03 15:46:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11656 states, 10306 states have (on average 1.5008732777023093) internal successors, (15468), 10504 states have internal predecessors, (15468), 756 states have call successors, (756), 432 states have call predecessors, (756), 592 states have return successors, (1219), 727 states have call predecessors, (1219), 756 states have call successors, (1219) [2025-03-03 15:46:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11656 states to 11656 states and 17443 transitions. [2025-03-03 15:46:22,793 INFO L78 Accepts]: Start accepts. Automaton has 11656 states and 17443 transitions. Word has length 130 [2025-03-03 15:46:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:22,793 INFO L471 AbstractCegarLoop]: Abstraction has 11656 states and 17443 transitions. [2025-03-03 15:46:22,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 11656 states and 17443 transitions. [2025-03-03 15:46:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:46:22,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:22,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:22,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:46:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 15:46:23,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1283469742, now seen corresponding path program 1 times [2025-03-03 15:46:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193139577] [2025-03-03 15:46:23,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:23,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:23,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:23,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:23,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193139577] [2025-03-03 15:46:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193139577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287364283] [2025-03-03 15:46:23,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:23,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:23,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:23,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:23,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:46:23,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:23,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:23,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:23,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:23,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:23,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:46:23,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287364283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:23,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:23,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:46:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95200055] [2025-03-03 15:46:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:23,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:23,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:23,197 INFO L87 Difference]: Start difference. First operand 11656 states and 17443 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:24,071 INFO L93 Difference]: Finished difference Result 30437 states and 44271 transitions. [2025-03-03 15:46:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:24,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2025-03-03 15:46:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:24,146 INFO L225 Difference]: With dead ends: 30437 [2025-03-03 15:46:24,146 INFO L226 Difference]: Without dead ends: 20914 [2025-03-03 15:46:24,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:24,235 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4146 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:24,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20914 states. [2025-03-03 15:46:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20914 to 20696. [2025-03-03 15:46:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20696 states, 18042 states have (on average 1.4581531980933378) internal successors, (26308), 18436 states have internal predecessors, (26308), 1468 states have call successors, (1468), 864 states have call predecessors, (1468), 1184 states have return successors, (2387), 1403 states have call predecessors, (2387), 1468 states have call successors, (2387) [2025-03-03 15:46:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 30163 transitions. [2025-03-03 15:46:24,952 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 30163 transitions. Word has length 130 [2025-03-03 15:46:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:24,953 INFO L471 AbstractCegarLoop]: Abstraction has 20696 states and 30163 transitions. [2025-03-03 15:46:24,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:46:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 30163 transitions. [2025-03-03 15:46:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:46:24,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:24,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:24,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:46:25,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:25,175 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1570376472, now seen corresponding path program 1 times [2025-03-03 15:46:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125556157] [2025-03-03 15:46:25,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:25,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:25,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:25,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:25,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:46:25,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:25,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125556157] [2025-03-03 15:46:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125556157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:25,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777567789] [2025-03-03 15:46:25,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:25,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:25,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:25,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:25,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:46:25,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:46:25,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:46:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:25,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:25,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:46:25,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777567789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:25,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:46:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762960777] [2025-03-03 15:46:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:25,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:25,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:25,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:25,350 INFO L87 Difference]: Start difference. First operand 20696 states and 30163 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:46:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:26,522 INFO L93 Difference]: Finished difference Result 56559 states and 81761 transitions. [2025-03-03 15:46:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:26,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 130 [2025-03-03 15:46:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:26,671 INFO L225 Difference]: With dead ends: 56559 [2025-03-03 15:46:26,672 INFO L226 Difference]: Without dead ends: 37997 [2025-03-03 15:46:26,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:26,721 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 197 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8567 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:26,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8567 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37997 states. [2025-03-03 15:46:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37997 to 37997. [2025-03-03 15:46:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37997 states, 32912 states have (on average 1.4311193485658726) internal successors, (47101), 33627 states have internal predecessors, (47101), 2753 states have call successors, (2753), 1690 states have call predecessors, (2753), 2330 states have return successors, (5010), 2695 states have call predecessors, (5010), 2753 states have call successors, (5010) [2025-03-03 15:46:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37997 states to 37997 states and 54864 transitions. [2025-03-03 15:46:28,606 INFO L78 Accepts]: Start accepts. Automaton has 37997 states and 54864 transitions. Word has length 130 [2025-03-03 15:46:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:28,608 INFO L471 AbstractCegarLoop]: Abstraction has 37997 states and 54864 transitions. [2025-03-03 15:46:28,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:46:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37997 states and 54864 transitions. [2025-03-03 15:46:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:46:28,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:28,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:28,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:46:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:28,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:28,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash -673862789, now seen corresponding path program 1 times [2025-03-03 15:46:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:28,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572955475] [2025-03-03 15:46:28,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:28,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:46:28,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:46:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:28,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:46:28,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572955475] [2025-03-03 15:46:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572955475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971093833] [2025-03-03 15:46:28,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:28,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:28,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:28,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:46:29,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:46:29,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:46:29,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:29,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:29,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:29,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 15:46:29,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:29,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971093833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:29,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:29,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:46:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747876385] [2025-03-03 15:46:29,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:29,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:29,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:29,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:29,180 INFO L87 Difference]: Start difference. First operand 37997 states and 54864 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:46:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:30,213 INFO L93 Difference]: Finished difference Result 62381 states and 89991 transitions. [2025-03-03 15:46:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 189 [2025-03-03 15:46:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:30,339 INFO L225 Difference]: With dead ends: 62381 [2025-03-03 15:46:30,339 INFO L226 Difference]: Without dead ends: 33881 [2025-03-03 15:46:30,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:30,403 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4108 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4108 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:30,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4108 Valid, 4225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33881 states. [2025-03-03 15:46:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33881 to 26045. [2025-03-03 15:46:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26045 states, 22856 states have (on average 1.4088641932096604) internal successors, (32201), 23095 states have internal predecessors, (32201), 1809 states have call successors, (1809), 1186 states have call predecessors, (1809), 1378 states have return successors, (2546), 1771 states have call predecessors, (2546), 1809 states have call successors, (2546) [2025-03-03 15:46:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26045 states to 26045 states and 36556 transitions. [2025-03-03 15:46:31,504 INFO L78 Accepts]: Start accepts. Automaton has 26045 states and 36556 transitions. Word has length 189 [2025-03-03 15:46:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:31,505 INFO L471 AbstractCegarLoop]: Abstraction has 26045 states and 36556 transitions. [2025-03-03 15:46:31,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:46:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26045 states and 36556 transitions. [2025-03-03 15:46:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:46:31,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:31,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:31,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:46:31,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:46:31,765 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:31,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1462486276, now seen corresponding path program 1 times [2025-03-03 15:46:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596681939] [2025-03-03 15:46:31,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:31,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:46:31,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:46:31,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:31,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:46:31,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596681939] [2025-03-03 15:46:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596681939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450027817] [2025-03-03 15:46:31,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:31,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:31,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:31,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:31,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:46:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:46:31,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:46:31,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:31,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:31,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:31,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:46:32,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450027817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:46:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693789567] [2025-03-03 15:46:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:32,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:32,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:32,041 INFO L87 Difference]: Start difference. First operand 26045 states and 36556 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:46:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:33,270 INFO L93 Difference]: Finished difference Result 52627 states and 73537 transitions. [2025-03-03 15:46:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:33,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 189 [2025-03-03 15:46:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:33,397 INFO L225 Difference]: With dead ends: 52627 [2025-03-03 15:46:33,397 INFO L226 Difference]: Without dead ends: 28723 [2025-03-03 15:46:33,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:33,463 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4125 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4125 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:33,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4125 Valid, 4222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28723 states. [2025-03-03 15:46:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28723 to 28723. [2025-03-03 15:46:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28723 states, 25330 states have (on average 1.3730359257797078) internal successors, (34779), 25569 states have internal predecessors, (34779), 1867 states have call successors, (1867), 1332 states have call predecessors, (1867), 1524 states have return successors, (2618), 1829 states have call predecessors, (2618), 1867 states have call successors, (2618) [2025-03-03 15:46:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 39264 transitions. [2025-03-03 15:46:35,232 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 39264 transitions. Word has length 189 [2025-03-03 15:46:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:35,233 INFO L471 AbstractCegarLoop]: Abstraction has 28723 states and 39264 transitions. [2025-03-03 15:46:35,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:46:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 39264 transitions. [2025-03-03 15:46:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:46:35,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:35,261 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:35,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:46:35,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:35,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:35,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:35,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1024898977, now seen corresponding path program 1 times [2025-03-03 15:46:35,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:35,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411837093] [2025-03-03 15:46:35,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:35,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:46:35,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:46:35,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:35,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:46:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411837093] [2025-03-03 15:46:35,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411837093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612490019] [2025-03-03 15:46:35,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:35,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:35,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:35,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:46:35,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:46:35,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:46:35,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:35,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:35,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:46:35,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 15:46:35,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:35,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612490019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:35,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:35,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:46:35,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011120566] [2025-03-03 15:46:35,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:35,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:35,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:35,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:35,695 INFO L87 Difference]: Start difference. First operand 28723 states and 39264 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:46:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:36,530 INFO L93 Difference]: Finished difference Result 51390 states and 69066 transitions. [2025-03-03 15:46:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:36,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 189 [2025-03-03 15:46:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:36,627 INFO L225 Difference]: With dead ends: 51390 [2025-03-03 15:46:36,627 INFO L226 Difference]: Without dead ends: 31167 [2025-03-03 15:46:36,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:36,668 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4117 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 4449 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:36,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 4449 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31167 states. [2025-03-03 15:46:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31167 to 31003. [2025-03-03 15:46:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31003 states, 27466 states have (on average 1.3486856477098959) internal successors, (37043), 27705 states have internal predecessors, (37043), 1895 states have call successors, (1895), 1448 states have call predecessors, (1895), 1640 states have return successors, (2762), 1857 states have call predecessors, (2762), 1895 states have call successors, (2762) [2025-03-03 15:46:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31003 states to 31003 states and 41700 transitions. [2025-03-03 15:46:37,655 INFO L78 Accepts]: Start accepts. Automaton has 31003 states and 41700 transitions. Word has length 189 [2025-03-03 15:46:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:37,656 INFO L471 AbstractCegarLoop]: Abstraction has 31003 states and 41700 transitions. [2025-03-03 15:46:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:46:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 31003 states and 41700 transitions. [2025-03-03 15:46:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 15:46:37,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:37,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:37,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:46:37,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:37,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:37,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1565769217, now seen corresponding path program 1 times [2025-03-03 15:46:37,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:37,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876039969] [2025-03-03 15:46:37,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:37,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:46:37,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:46:37,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:37,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:46:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876039969] [2025-03-03 15:46:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876039969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511081698] [2025-03-03 15:46:37,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:37,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:37,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:37,960 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:37,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:46:38,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:46:38,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:46:38,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:38,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:38,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:38,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:46:38,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511081698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:38,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:38,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:46:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530486184] [2025-03-03 15:46:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:38,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:38,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:38,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:38,094 INFO L87 Difference]: Start difference. First operand 31003 states and 41700 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:46:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:39,902 INFO L93 Difference]: Finished difference Result 85063 states and 113658 transitions. [2025-03-03 15:46:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:39,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 190 [2025-03-03 15:46:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:40,116 INFO L225 Difference]: With dead ends: 85063 [2025-03-03 15:46:40,117 INFO L226 Difference]: Without dead ends: 56201 [2025-03-03 15:46:40,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:40,186 INFO L435 NwaCegarLoop]: 4376 mSDtfsCounter, 179 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 8552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:40,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 8552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56201 states. [2025-03-03 15:46:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56201 to 56199. [2025-03-03 15:46:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56199 states, 49448 states have (on average 1.3241587121824947) internal successors, (65477), 49925 states have internal predecessors, (65477), 3629 states have call successors, (3629), 2736 states have call predecessors, (3629), 3120 states have return successors, (6322), 3553 states have call predecessors, (6322), 3629 states have call successors, (6322) [2025-03-03 15:46:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56199 states to 56199 states and 75428 transitions. [2025-03-03 15:46:43,085 INFO L78 Accepts]: Start accepts. Automaton has 56199 states and 75428 transitions. Word has length 190 [2025-03-03 15:46:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:43,086 INFO L471 AbstractCegarLoop]: Abstraction has 56199 states and 75428 transitions. [2025-03-03 15:46:43,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:46:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 56199 states and 75428 transitions. [2025-03-03 15:46:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 15:46:43,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:43,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:43,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 15:46:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:46:43,344 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:43,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1460166588, now seen corresponding path program 1 times [2025-03-03 15:46:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722954271] [2025-03-03 15:46:43,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:43,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:46:43,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:46:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 15:46:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722954271] [2025-03-03 15:46:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722954271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866227784] [2025-03-03 15:46:43,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:43,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:43,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:43,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:46:43,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:46:43,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:46:43,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:43,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:43,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:43,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 15:46:43,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866227784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:43,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:43,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:46:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337788291] [2025-03-03 15:46:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:43,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:43,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:43,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:43,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:43,581 INFO L87 Difference]: Start difference. First operand 56199 states and 75428 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:46:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:45,403 INFO L93 Difference]: Finished difference Result 114137 states and 154137 transitions. [2025-03-03 15:46:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:46:45,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 191 [2025-03-03 15:46:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:45,596 INFO L225 Difference]: With dead ends: 114137 [2025-03-03 15:46:45,596 INFO L226 Difference]: Without dead ends: 60087 [2025-03-03 15:46:45,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:45,678 INFO L435 NwaCegarLoop]: 4187 mSDtfsCounter, 4138 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:45,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:46:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60087 states. [2025-03-03 15:46:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60087 to 56199. [2025-03-03 15:46:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56199 states, 49448 states have (on average 1.3044208056948714) internal successors, (64501), 49925 states have internal predecessors, (64501), 3629 states have call successors, (3629), 2736 states have call predecessors, (3629), 3120 states have return successors, (5974), 3553 states have call predecessors, (5974), 3629 states have call successors, (5974) [2025-03-03 15:46:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56199 states to 56199 states and 74104 transitions. [2025-03-03 15:46:47,787 INFO L78 Accepts]: Start accepts. Automaton has 56199 states and 74104 transitions. Word has length 191 [2025-03-03 15:46:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:47,787 INFO L471 AbstractCegarLoop]: Abstraction has 56199 states and 74104 transitions. [2025-03-03 15:46:47,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:46:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 56199 states and 74104 transitions. [2025-03-03 15:46:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 15:46:47,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:47,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:47,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 15:46:48,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 15:46:48,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:48,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash -818246298, now seen corresponding path program 1 times [2025-03-03 15:46:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150635617] [2025-03-03 15:46:48,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:48,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:46:48,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:46:48,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:48,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 15:46:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:48,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150635617] [2025-03-03 15:46:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150635617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:46:48,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902487107] [2025-03-03 15:46:48,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:46:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:48,296 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:46:48,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:46:48,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:46:48,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:46:48,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:48,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:48,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:46:48,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:46:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 15:46:48,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:46:48,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902487107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:48,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:46:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:46:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881836908] [2025-03-03 15:46:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:48,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:46:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:48,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:46:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:48,412 INFO L87 Difference]: Start difference. First operand 56199 states and 74104 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)