./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-1.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_label49+token_ring.05.cil-1.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 211a040b667c92c6d715ed7462c0db91088ae0b583b29f60ca2f33cb3ca9ce8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:48:10,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:48:10,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:48:10,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:48:10,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:48:10,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:48:10,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:48:10,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:48:10,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:48:10,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:48:10,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:48:10,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:48:10,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:48:10,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:48:10,360 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:48:10,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:48:10,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:48:10,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:48:10,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:48:10,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:48:10,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:48:10,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:48:10,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:48:10,362 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 -> 211a040b667c92c6d715ed7462c0db91088ae0b583b29f60ca2f33cb3ca9ce8b [2025-03-03 15:48:10,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:48:10,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:48:10,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:48:10,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:48:10,599 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:48:10,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-1.c [2025-03-03 15:48:11,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f949a70/0a499b89f6c047f78e030f294f7b3040/FLAG84c5d2750 [2025-03-03 15:48:12,298 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:48:12,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-1.c [2025-03-03 15:48:12,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f949a70/0a499b89f6c047f78e030f294f7b3040/FLAG84c5d2750 [2025-03-03 15:48:12,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f949a70/0a499b89f6c047f78e030f294f7b3040 [2025-03-03 15:48:12,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:48:12,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:48:12,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:48:12,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:48:12,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:48:12,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:48:12" (1/1) ... [2025-03-03 15:48:12,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e952a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:12, skipping insertion in model container [2025-03-03 15:48:12,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:48:12" (1/1) ... [2025-03-03 15:48:12,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:48:14,030 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_label49+token_ring.05.cil-1.c[380593,380606] [2025-03-03 15:48:14,057 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_label49+token_ring.05.cil-1.c[383339,383352] [2025-03-03 15:48:14,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:48:14,225 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:48:14,705 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_label49+token_ring.05.cil-1.c[380593,380606] [2025-03-03 15:48:14,710 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_label49+token_ring.05.cil-1.c[383339,383352] [2025-03-03 15:48:14,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:48:14,773 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:48:14,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14 WrapperNode [2025-03-03 15:48:14,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:48:14,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:48:14,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:48:14,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:48:14,780 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:48:14" (1/1) ... [2025-03-03 15:48:14,847 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:48:14" (1/1) ... [2025-03-03 15:48:15,151 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-03-03 15:48:15,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:48:15,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:48:15,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:48:15,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:48:15,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,269 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:48:15,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,384 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:48:15,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:48:15,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:48:15,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:48:15,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (1/1) ... [2025-03-03 15:48:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:48:15,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:15,513 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:48:15,517 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:48:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:48:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:48:15,536 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:48:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:48:15,536 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:48:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:48:15,537 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:48:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:48:15,537 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:48:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:48:15,537 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:48:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:48:15,537 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:48:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:48:15,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:48:15,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:48:15,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:48:15,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:48:21,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:48:21,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:48:21,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:48:21,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:48:21,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:48:21,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:48:21,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:48:21,894 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-03-03 15:48:21,895 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:48:21,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:48:21,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:48:21,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:48:21 BoogieIcfgContainer [2025-03-03 15:48:21,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:48:21,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:48:21,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:48:21,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:48:21,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:48:12" (1/3) ... [2025-03-03 15:48:21,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57db5fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:48:21, skipping insertion in model container [2025-03-03 15:48:21,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:48:14" (2/3) ... [2025-03-03 15:48:21,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57db5fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:48:21, skipping insertion in model container [2025-03-03 15:48:21,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:48:21" (3/3) ... [2025-03-03 15:48:21,993 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.05.cil-1.c [2025-03-03 15:48:22,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:48:22,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.05.cil-1.c that has 7 procedures, 2402 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-03 15:48:22,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:48:22,188 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;@24c673de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:48:22,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:48:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 15:48:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:22,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:22,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:22,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:22,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1126425006, now seen corresponding path program 1 times [2025-03-03 15:48:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352902730] [2025-03-03 15:48:22,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:22,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:22,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:22,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:22,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:22,628 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:48:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:22,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352902730] [2025-03-03 15:48:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352902730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:22,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:22,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035512775] [2025-03-03 15:48:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:22,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:22,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:22,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:22,661 INFO L87 Difference]: Start difference. First operand has 2402 states, 2374 states have (on average 1.8445661331086773) internal successors, (4379), 2377 states have internal predecessors, (4379), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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:48:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:23,160 INFO L93 Difference]: Finished difference Result 5015 states and 9165 transitions. [2025-03-03 15:48:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:48:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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 101 [2025-03-03 15:48:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:23,188 INFO L225 Difference]: With dead ends: 5015 [2025-03-03 15:48:23,189 INFO L226 Difference]: Without dead ends: 2556 [2025-03-03 15:48:23,200 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:48:23,202 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4593 mSDsluCounter, 8689 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 12967 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:23,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 12967 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:48:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-03-03 15:48:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2541. [2025-03-03 15:48:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8134777376654634) internal successors, (4521), 2496 states have internal predecessors, (4521), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:48:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4588 transitions. [2025-03-03 15:48:23,347 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4588 transitions. Word has length 101 [2025-03-03 15:48:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:23,348 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4588 transitions. [2025-03-03 15:48:23,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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:48:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4588 transitions. [2025-03-03 15:48:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:23,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:23,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:23,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:48:23,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:23,354 INFO L85 PathProgramCache]: Analyzing trace with hash 267982704, now seen corresponding path program 1 times [2025-03-03 15:48:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962818451] [2025-03-03 15:48:23,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:23,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:23,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:23,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:23,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:23,522 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:48:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962818451] [2025-03-03 15:48:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962818451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:23,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281140948] [2025-03-03 15:48:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:23,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:23,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:23,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:23,527 INFO L87 Difference]: Start difference. First operand 2541 states and 4588 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:23,757 INFO L93 Difference]: Finished difference Result 2984 states and 5267 transitions. [2025-03-03 15:48:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:23,767 INFO L225 Difference]: With dead ends: 2984 [2025-03-03 15:48:23,768 INFO L226 Difference]: Without dead ends: 2577 [2025-03-03 15:48:23,770 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:48:23,770 INFO L435 NwaCegarLoop]: 4197 mSDtfsCounter, 4370 mSDsluCounter, 8309 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4383 SdHoareTripleChecker+Valid, 12506 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:23,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4383 Valid, 12506 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-03-03 15:48:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2541. [2025-03-03 15:48:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2493 states have (on average 1.8126754913758525) internal successors, (4519), 2496 states have internal predecessors, (4519), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-03 15:48:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4586 transitions. [2025-03-03 15:48:23,913 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4586 transitions. Word has length 101 [2025-03-03 15:48:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:23,913 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 4586 transitions. [2025-03-03 15:48:23,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4586 transitions. [2025-03-03 15:48:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:23,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:23,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:23,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:48:23,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1475900879, now seen corresponding path program 1 times [2025-03-03 15:48:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375989648] [2025-03-03 15:48:23,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:23,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:23,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:23,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:24,091 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:48:24,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375989648] [2025-03-03 15:48:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375989648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691559784] [2025-03-03 15:48:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:24,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:24,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:24,093 INFO L87 Difference]: Start difference. First operand 2541 states and 4586 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:24,537 INFO L93 Difference]: Finished difference Result 3199 states and 5583 transitions. [2025-03-03 15:48:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:24,548 INFO L225 Difference]: With dead ends: 3199 [2025-03-03 15:48:24,548 INFO L226 Difference]: Without dead ends: 2792 [2025-03-03 15:48:24,550 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:48:24,551 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 4514 mSDsluCounter, 13119 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4527 SdHoareTripleChecker+Valid, 17490 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:24,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4527 Valid, 17490 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:48:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2025-03-03 15:48:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2733. [2025-03-03 15:48:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2733 states, 2664 states have (on average 1.7909159159159158) internal successors, (4771), 2668 states have internal predecessors, (4771), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-03 15:48:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 4869 transitions. [2025-03-03 15:48:24,620 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 4869 transitions. Word has length 101 [2025-03-03 15:48:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:24,621 INFO L471 AbstractCegarLoop]: Abstraction has 2733 states and 4869 transitions. [2025-03-03 15:48:24,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 4869 transitions. [2025-03-03 15:48:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:24,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:24,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:24,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:48:24,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:24,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:24,622 INFO L85 PathProgramCache]: Analyzing trace with hash -9154672, now seen corresponding path program 1 times [2025-03-03 15:48:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:24,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437973773] [2025-03-03 15:48:24,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:24,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:24,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:24,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:24,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:24,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:24,760 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:48:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437973773] [2025-03-03 15:48:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437973773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:24,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:24,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640513492] [2025-03-03 15:48:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:24,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:24,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:24,763 INFO L87 Difference]: Start difference. First operand 2733 states and 4869 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:25,194 INFO L93 Difference]: Finished difference Result 3800 states and 6481 transitions. [2025-03-03 15:48:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:25,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:25,207 INFO L225 Difference]: With dead ends: 3800 [2025-03-03 15:48:25,207 INFO L226 Difference]: Without dead ends: 3201 [2025-03-03 15:48:25,210 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:48:25,211 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4509 mSDsluCounter, 13107 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 17474 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:25,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 17474 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:48:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2025-03-03 15:48:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3136. [2025-03-03 15:48:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3023 states have (on average 1.7552100562355277) internal successors, (5306), 3031 states have internal predecessors, (5306), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-03 15:48:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 5472 transitions. [2025-03-03 15:48:25,355 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 5472 transitions. Word has length 101 [2025-03-03 15:48:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:25,356 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 5472 transitions. [2025-03-03 15:48:25,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 5472 transitions. [2025-03-03 15:48:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:25,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:25,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:25,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:48:25,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:25,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash 774224303, now seen corresponding path program 1 times [2025-03-03 15:48:25,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:25,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737208112] [2025-03-03 15:48:25,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:25,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:25,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:25,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:25,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:25,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:25,493 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:48:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737208112] [2025-03-03 15:48:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737208112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744346789] [2025-03-03 15:48:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:25,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:25,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:25,494 INFO L87 Difference]: Start difference. First operand 3136 states and 5472 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:26,011 INFO L93 Difference]: Finished difference Result 5073 states and 8422 transitions. [2025-03-03 15:48:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:26,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:26,029 INFO L225 Difference]: With dead ends: 5073 [2025-03-03 15:48:26,029 INFO L226 Difference]: Without dead ends: 4071 [2025-03-03 15:48:26,033 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:48:26,034 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4504 mSDsluCounter, 13098 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 17462 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:26,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 17462 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2025-03-03 15:48:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3993. [2025-03-03 15:48:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3786 states have (on average 1.705758055995774) internal successors, (6458), 3808 states have internal predecessors, (6458), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-03 15:48:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 6784 transitions. [2025-03-03 15:48:26,138 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 6784 transitions. Word has length 101 [2025-03-03 15:48:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:26,138 INFO L471 AbstractCegarLoop]: Abstraction has 3993 states and 6784 transitions. [2025-03-03 15:48:26,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 6784 transitions. [2025-03-03 15:48:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:26,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:26,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:48:26,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash 245305264, now seen corresponding path program 1 times [2025-03-03 15:48:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412408297] [2025-03-03 15:48:26,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:26,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:26,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:26,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:26,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:26,239 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:48:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412408297] [2025-03-03 15:48:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412408297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880338383] [2025-03-03 15:48:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:26,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:26,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:26,241 INFO L87 Difference]: Start difference. First operand 3993 states and 6784 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:26,771 INFO L93 Difference]: Finished difference Result 8086 states and 13121 transitions. [2025-03-03 15:48:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:26,794 INFO L225 Difference]: With dead ends: 8086 [2025-03-03 15:48:26,795 INFO L226 Difference]: Without dead ends: 6227 [2025-03-03 15:48:26,800 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:48:26,801 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4660 mSDsluCounter, 13068 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4679 SdHoareTripleChecker+Valid, 17423 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:26,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4679 Valid, 17423 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2025-03-03 15:48:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 5791. [2025-03-03 15:48:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6531748978834013) internal successors, (8904), 5454 states have internal predecessors, (8904), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:48:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9630 transitions. [2025-03-03 15:48:26,980 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9630 transitions. Word has length 101 [2025-03-03 15:48:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:26,980 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9630 transitions. [2025-03-03 15:48:26,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9630 transitions. [2025-03-03 15:48:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:26,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:26,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:26,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:48:26,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:26,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:26,986 INFO L85 PathProgramCache]: Analyzing trace with hash 365425137, now seen corresponding path program 1 times [2025-03-03 15:48:26,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:26,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302610137] [2025-03-03 15:48:26,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:26,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:26,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:26,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:26,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:27,070 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:48:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302610137] [2025-03-03 15:48:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302610137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:27,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:27,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:27,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804035833] [2025-03-03 15:48:27,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:27,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:27,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:27,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:27,073 INFO L87 Difference]: Start difference. First operand 5791 states and 9630 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:27,357 INFO L93 Difference]: Finished difference Result 9946 states and 16320 transitions. [2025-03-03 15:48:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:27,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:27,396 INFO L225 Difference]: With dead ends: 9946 [2025-03-03 15:48:27,396 INFO L226 Difference]: Without dead ends: 6289 [2025-03-03 15:48:27,407 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:48:27,407 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4360 mSDsluCounter, 8282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4373 SdHoareTripleChecker+Valid, 12466 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:27,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4373 Valid, 12466 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2025-03-03 15:48:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 5791. [2025-03-03 15:48:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5386 states have (on average 1.6500185666542888) internal successors, (8887), 5454 states have internal predecessors, (8887), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-03 15:48:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 9613 transitions. [2025-03-03 15:48:27,628 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 9613 transitions. Word has length 101 [2025-03-03 15:48:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:27,629 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 9613 transitions. [2025-03-03 15:48:27,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 9613 transitions. [2025-03-03 15:48:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:27,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:27,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:27,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:48:27,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:27,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:27,635 INFO L85 PathProgramCache]: Analyzing trace with hash 784941968, now seen corresponding path program 1 times [2025-03-03 15:48:27,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:27,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807000084] [2025-03-03 15:48:27,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:27,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:27,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:27,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:27,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:27,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:27,728 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:48:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:27,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807000084] [2025-03-03 15:48:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807000084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914115194] [2025-03-03 15:48:27,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:27,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:27,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:27,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:27,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:27,730 INFO L87 Difference]: Start difference. First operand 5791 states and 9613 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:28,336 INFO L93 Difference]: Finished difference Result 13810 states and 22442 transitions. [2025-03-03 15:48:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:28,401 INFO L225 Difference]: With dead ends: 13810 [2025-03-03 15:48:28,401 INFO L226 Difference]: Without dead ends: 10153 [2025-03-03 15:48:28,422 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:48:28,423 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4587 mSDsluCounter, 13045 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 17392 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:28,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 17392 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2025-03-03 15:48:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 9579. [2025-03-03 15:48:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6043289051763627) internal successors, (14009), 8946 states have internal predecessors, (14009), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:48:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15903 transitions. [2025-03-03 15:48:28,899 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15903 transitions. Word has length 101 [2025-03-03 15:48:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:28,899 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15903 transitions. [2025-03-03 15:48:28,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15903 transitions. [2025-03-03 15:48:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:28,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:28,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:28,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:48:28,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 798474769, now seen corresponding path program 1 times [2025-03-03 15:48:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579846838] [2025-03-03 15:48:28,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:28,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:28,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:28,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:28,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:29,005 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:48:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579846838] [2025-03-03 15:48:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579846838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692495273] [2025-03-03 15:48:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:29,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:29,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:29,006 INFO L87 Difference]: Start difference. First operand 9579 states and 15903 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:29,391 INFO L93 Difference]: Finished difference Result 18004 states and 30144 transitions. [2025-03-03 15:48:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:29,484 INFO L225 Difference]: With dead ends: 18004 [2025-03-03 15:48:29,484 INFO L226 Difference]: Without dead ends: 10559 [2025-03-03 15:48:29,498 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:48:29,499 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4356 mSDsluCounter, 8273 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12452 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:29,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12452 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-03-03 15:48:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 9579. [2025-03-03 15:48:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.6005497022446176) internal successors, (13976), 8946 states have internal predecessors, (13976), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:48:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15870 transitions. [2025-03-03 15:48:29,972 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15870 transitions. Word has length 101 [2025-03-03 15:48:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:29,972 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15870 transitions. [2025-03-03 15:48:29,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15870 transitions. [2025-03-03 15:48:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:29,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:29,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:48:29,979 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1907289968, now seen corresponding path program 1 times [2025-03-03 15:48:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148407321] [2025-03-03 15:48:29,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:29,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:29,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:29,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:29,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:30,054 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:48:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148407321] [2025-03-03 15:48:30,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148407321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:30,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:30,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:48:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205773722] [2025-03-03 15:48:30,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:30,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:48:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:30,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:48:30,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:48:30,056 INFO L87 Difference]: Start difference. First operand 9579 states and 15870 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:30,621 INFO L93 Difference]: Finished difference Result 17759 states and 29588 transitions. [2025-03-03 15:48:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:30,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:30,654 INFO L225 Difference]: With dead ends: 17759 [2025-03-03 15:48:30,655 INFO L226 Difference]: Without dead ends: 10314 [2025-03-03 15:48:30,669 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:48:30,670 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4353 mSDsluCounter, 8268 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4366 SdHoareTripleChecker+Valid, 12444 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:30,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4366 Valid, 12444 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:48:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10314 states. [2025-03-03 15:48:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10314 to 9579. [2025-03-03 15:48:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9579 states, 8732 states have (on average 1.5967704993128722) internal successors, (13943), 8946 states have internal predecessors, (13943), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-03 15:48:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9579 states to 9579 states and 15837 transitions. [2025-03-03 15:48:30,982 INFO L78 Accepts]: Start accepts. Automaton has 9579 states and 15837 transitions. Word has length 101 [2025-03-03 15:48:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:30,982 INFO L471 AbstractCegarLoop]: Abstraction has 9579 states and 15837 transitions. [2025-03-03 15:48:30,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:48:30,982 INFO L276 IsEmpty]: Start isEmpty. Operand 9579 states and 15837 transitions. [2025-03-03 15:48:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:30,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:30,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:30,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:48:30,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1520625103, now seen corresponding path program 1 times [2025-03-03 15:48:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:30,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124240443] [2025-03-03 15:48:30,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:30,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:30,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:30,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:30,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:48:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124240443] [2025-03-03 15:48:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124240443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:48:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782047920] [2025-03-03 15:48:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:31,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:48:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:31,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:48:31,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:31,074 INFO L87 Difference]: Start difference. First operand 9579 states and 15837 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:31,949 INFO L93 Difference]: Finished difference Result 24974 states and 41916 transitions. [2025-03-03 15:48:31,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:48:31,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:32,018 INFO L225 Difference]: With dead ends: 24974 [2025-03-03 15:48:32,018 INFO L226 Difference]: Without dead ends: 17529 [2025-03-03 15:48:32,042 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:48:32,043 INFO L435 NwaCegarLoop]: 4334 mSDtfsCounter, 4476 mSDsluCounter, 13008 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 17342 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:32,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 17342 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:48:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2025-03-03 15:48:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 17188. [2025-03-03 15:48:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17188 states, 15311 states have (on average 1.5512376722617727) internal successors, (23751), 15979 states have internal predecessors, (23751), 819 states have call successors, (819), 390 states have call predecessors, (819), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-03 15:48:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 29485 transitions. [2025-03-03 15:48:32,847 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 29485 transitions. Word has length 101 [2025-03-03 15:48:32,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:32,848 INFO L471 AbstractCegarLoop]: Abstraction has 17188 states and 29485 transitions. [2025-03-03 15:48:32,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 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:48:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 29485 transitions. [2025-03-03 15:48:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:48:32,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:32,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:32,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:48:32,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1077013680, now seen corresponding path program 1 times [2025-03-03 15:48:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160525910] [2025-03-03 15:48:32,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:32,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:48:32,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:48:32,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:32,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:32,924 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:48:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:32,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160525910] [2025-03-03 15:48:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160525910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:32,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:48:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:48:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025669826] [2025-03-03 15:48:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:32,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:48:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:32,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:48:32,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:48:32,927 INFO L87 Difference]: Start difference. First operand 17188 states and 29485 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:48:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:34,494 INFO L93 Difference]: Finished difference Result 46966 states and 80758 transitions. [2025-03-03 15:48:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:48:34,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2025-03-03 15:48:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:34,616 INFO L225 Difference]: With dead ends: 46966 [2025-03-03 15:48:34,616 INFO L226 Difference]: Without dead ends: 31913 [2025-03-03 15:48:34,651 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:48:34,652 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 4499 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 9021 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:48:34,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 9021 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:48:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31913 states. [2025-03-03 15:48:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31913 to 31848. [2025-03-03 15:48:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31848 states, 28100 states have (on average 1.5165836298932385) internal successors, (42616), 29499 states have internal predecessors, (42616), 1634 states have call successors, (1634), 780 states have call predecessors, (1634), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-03 15:48:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31848 states to 31848 states and 54013 transitions. [2025-03-03 15:48:35,999 INFO L78 Accepts]: Start accepts. Automaton has 31848 states and 54013 transitions. Word has length 101 [2025-03-03 15:48:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:36,000 INFO L471 AbstractCegarLoop]: Abstraction has 31848 states and 54013 transitions. [2025-03-03 15:48:36,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:48:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31848 states and 54013 transitions. [2025-03-03 15:48:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:48:36,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:36,049 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:36,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:48:36,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash -638692433, now seen corresponding path program 1 times [2025-03-03 15:48:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752012111] [2025-03-03 15:48:36,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:36,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:48:36,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:48:36,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:36,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:48:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752012111] [2025-03-03 15:48:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752012111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:48:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926000122] [2025-03-03 15:48:36,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:36,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:48:36,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:36,120 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:48:36,123 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:48:36,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:48:36,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:48:36,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:36,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:48:36,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:48:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:48:36,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:48:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926000122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:36,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:48:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:48:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31533835] [2025-03-03 15:48:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:36,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:48:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:36,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:48:36,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:36,305 INFO L87 Difference]: Start difference. First operand 31848 states and 54013 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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:48:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:38,718 INFO L93 Difference]: Finished difference Result 90623 states and 153823 transitions. [2025-03-03 15:48:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:48:38,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 166 [2025-03-03 15:48:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:38,927 INFO L225 Difference]: With dead ends: 90623 [2025-03-03 15:48:38,927 INFO L226 Difference]: Without dead ends: 60910 [2025-03-03 15:48:38,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 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:48:38,996 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4219 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 4552 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:48:38,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4219 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:48:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60910 states. [2025-03-03 15:48:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60910 to 60518. [2025-03-03 15:48:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60518 states, 53158 states have (on average 1.5041197938221904) internal successors, (79956), 55954 states have internal predecessors, (79956), 3134 states have call successors, (3134), 1560 states have call predecessors, (3134), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-03 15:48:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 102419 transitions. [2025-03-03 15:48:42,607 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 102419 transitions. Word has length 166 [2025-03-03 15:48:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:42,607 INFO L471 AbstractCegarLoop]: Abstraction has 60518 states and 102419 transitions. [2025-03-03 15:48:42,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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:48:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 102419 transitions. [2025-03-03 15:48:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:48:42,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:42,678 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:42,686 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:48:42,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:48:42,879 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:42,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash -229481751, now seen corresponding path program 1 times [2025-03-03 15:48:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:42,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040792269] [2025-03-03 15:48:42,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:42,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:48:42,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:48:42,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:42,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:48:42,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040792269] [2025-03-03 15:48:42,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040792269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:48:42,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175922514] [2025-03-03 15:48:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:42,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:48:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:42,950 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:48:42,952 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:48:43,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:48:43,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:48:43,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:43,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:43,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:48:43,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:48:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:48:43,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:48:43,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175922514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:43,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:48:43,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:48:43,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241693663] [2025-03-03 15:48:43,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:43,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:48:43,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:43,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:48:43,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:43,128 INFO L87 Difference]: Start difference. First operand 60518 states and 102419 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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:48:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:48:47,855 INFO L93 Difference]: Finished difference Result 175983 states and 298721 transitions. [2025-03-03 15:48:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:48:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 166 [2025-03-03 15:48:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:48:48,375 INFO L225 Difference]: With dead ends: 175983 [2025-03-03 15:48:48,375 INFO L226 Difference]: Without dead ends: 117600 [2025-03-03 15:48:48,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 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:48:48,539 INFO L435 NwaCegarLoop]: 4269 mSDtfsCounter, 4213 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 4552 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:48:48,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4213 Valid, 4552 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:48:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117600 states. [2025-03-03 15:48:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117600 to 116818. [2025-03-03 15:48:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116818 states, 102364 states have (on average 1.497948497518659) internal successors, (153336), 107954 states have internal predecessors, (153336), 6004 states have call successors, (6004), 3120 states have call predecessors, (6004), 8448 states have return successors, (38331), 5807 states have call predecessors, (38331), 6004 states have call successors, (38331) [2025-03-03 15:48:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116818 states to 116818 states and 197671 transitions. [2025-03-03 15:48:54,284 INFO L78 Accepts]: Start accepts. Automaton has 116818 states and 197671 transitions. Word has length 166 [2025-03-03 15:48:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:48:54,285 INFO L471 AbstractCegarLoop]: Abstraction has 116818 states and 197671 transitions. [2025-03-03 15:48:54,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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:48:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 116818 states and 197671 transitions. [2025-03-03 15:48:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:48:54,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:48:54,418 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:48:54,426 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:48:54,618 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,SelfDestructingSolverStorable13 [2025-03-03 15:48:54,619 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:48:54,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:48:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -304552541, now seen corresponding path program 1 times [2025-03-03 15:48:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:48:54,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926249287] [2025-03-03 15:48:54,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:48:54,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:48:54,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:48:54,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:54,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:48:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:48:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926249287] [2025-03-03 15:48:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926249287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:48:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818714818] [2025-03-03 15:48:54,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:48:54,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:48:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:48:54,700 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:48:54,702 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:48:54,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:48:54,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:48:54,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:48:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:48:54,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:48:54,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:48:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:48:54,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:48:54,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818714818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:48:54,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:48:54,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:48:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753436251] [2025-03-03 15:48:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:48:54,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:48:54,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:48:54,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:48:54,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:48:54,921 INFO L87 Difference]: Start difference. First operand 116818 states and 197671 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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)