./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.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_label46+token_ring.14.cil.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 b4ef8e9ed2cd06e3f1b2681e4efb1f48663612c7770f819d08e3f1f515d36787 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:45:38,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:45:38,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:45:38,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:45:38,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:45:38,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:45:38,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:45:38,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:45:38,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:45:38,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:45:38,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:45:38,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:45:38,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:45:38,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:45:38,207 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:45:38,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:45:38,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:45:38,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:45:38,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:45:38,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:45:38,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:45:38,210 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 -> b4ef8e9ed2cd06e3f1b2681e4efb1f48663612c7770f819d08e3f1f515d36787 [2025-03-03 15:45:38,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:45:38,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:45:38,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:45:38,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:45:38,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:45:38,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c [2025-03-03 15:45:39,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f35f1a1/6f6811bb152f41de8418b009115d887f/FLAG00768c014 [2025-03-03 15:45:40,273 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:45:40,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c [2025-03-03 15:45:40,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f35f1a1/6f6811bb152f41de8418b009115d887f/FLAG00768c014 [2025-03-03 15:45:40,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f35f1a1/6f6811bb152f41de8418b009115d887f [2025-03-03 15:45:40,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:45:40,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:45:40,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:45:40,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:45:40,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:45:40,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:45:40" (1/1) ... [2025-03-03 15:45:40,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608c7e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:40, skipping insertion in model container [2025-03-03 15:45:40,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:45:40" (1/1) ... [2025-03-03 15:45:40,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:45:42,004 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_label46+token_ring.14.cil.c[382357,382370] [2025-03-03 15:45:42,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_label46+token_ring.14.cil.c[383339,383352] [2025-03-03 15:45:42,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:45:42,303 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:45:42,851 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_label46+token_ring.14.cil.c[382357,382370] [2025-03-03 15:45:42,854 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_label46+token_ring.14.cil.c[383339,383352] [2025-03-03 15:45:42,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:45:42,925 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:45:42,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42 WrapperNode [2025-03-03 15:45:42,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:45:42,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:45:42,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:45:42,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:45:42,933 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:45:42" (1/1) ... [2025-03-03 15:45:43,028 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:45:42" (1/1) ... [2025-03-03 15:45:43,345 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13189 [2025-03-03 15:45:43,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:45:43,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:45:43,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:45:43,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:45:43,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,538 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:45:43,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:45:43,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:45:43,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:45:43,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:45:43,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (1/1) ... [2025-03-03 15:45:43,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:45:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:45:43,928 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:45:43,934 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:45:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:45:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:45:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:45:43,949 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:45:43,949 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:45:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:45:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:45:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:45:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:45:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:45:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:45:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:45:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:45:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:45:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:45:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:45:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:45:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:45:44,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:45:44,062 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:45:50,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:45:50,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:45:50,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:45:50,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:45:50,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:45:50,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:45:50,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:45:50,703 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2025-03-03 15:45:50,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:45:50,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:45:50,762 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:45:50,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:45:50 BoogieIcfgContainer [2025-03-03 15:45:50,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:45:50,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:45:50,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:45:50,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:45:50,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:45:40" (1/3) ... [2025-03-03 15:45:50,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de80715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:45:50, skipping insertion in model container [2025-03-03 15:45:50,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:45:42" (2/3) ... [2025-03-03 15:45:50,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de80715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:45:50, skipping insertion in model container [2025-03-03 15:45:50,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:45:50" (3/3) ... [2025-03-03 15:45:50,771 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.14.cil.c [2025-03-03 15:45:50,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:45:50,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.14.cil.c that has 8 procedures, 2597 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-03 15:45:50,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:45:50,901 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;@49c65921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:45:50,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:45:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 2597 states, 2559 states have (on average 1.8284486127393513) internal successors, (4679), 2564 states have internal predecessors, (4679), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 15:45:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:45:50,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:50,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:50,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:50,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash 505805513, now seen corresponding path program 1 times [2025-03-03 15:45:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:50,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664705199] [2025-03-03 15:45:50,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:51,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:45:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:45:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:51,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:51,469 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:45:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:51,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664705199] [2025-03-03 15:45:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664705199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:51,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183918823] [2025-03-03 15:45:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:51,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:51,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:51,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:51,498 INFO L87 Difference]: Start difference. First operand has 2597 states, 2559 states have (on average 1.8284486127393513) internal successors, (4679), 2564 states have internal predecessors, (4679), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:52,352 INFO L93 Difference]: Finished difference Result 5612 states and 10147 transitions. [2025-03-03 15:45:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:45:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:45:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:52,382 INFO L225 Difference]: With dead ends: 5612 [2025-03-03 15:45:52,384 INFO L226 Difference]: Without dead ends: 2965 [2025-03-03 15:45:52,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:52,396 INFO L435 NwaCegarLoop]: 4523 mSDtfsCounter, 5212 mSDsluCounter, 9336 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5232 SdHoareTripleChecker+Valid, 13859 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:52,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 13859 Invalid, 697 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:45:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-03-03 15:45:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2934. [2025-03-03 15:45:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2870 states have (on average 1.7843205574912893) internal successors, (5121), 2874 states have internal predecessors, (5121), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-03 15:45:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5218 transitions. [2025-03-03 15:45:52,549 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5218 transitions. Word has length 179 [2025-03-03 15:45:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:52,549 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5218 transitions. [2025-03-03 15:45:52,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5218 transitions. [2025-03-03 15:45:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:45:52,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:52,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:52,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:45:52,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:52,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1960419271, now seen corresponding path program 1 times [2025-03-03 15:45:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213646513] [2025-03-03 15:45:52,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:52,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:45:52,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:45:52,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:52,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:52,786 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:45:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213646513] [2025-03-03 15:45:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213646513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:52,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:52,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:45:52,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452942606] [2025-03-03 15:45:52,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:45:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:45:52,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:45:52,790 INFO L87 Difference]: Start difference. First operand 2934 states and 5218 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:53,204 INFO L93 Difference]: Finished difference Result 3805 states and 6597 transitions. [2025-03-03 15:45:53,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:45:53,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:45:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:53,221 INFO L225 Difference]: With dead ends: 3805 [2025-03-03 15:45:53,221 INFO L226 Difference]: Without dead ends: 3012 [2025-03-03 15:45:53,225 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:45:53,227 INFO L435 NwaCegarLoop]: 4442 mSDtfsCounter, 4806 mSDsluCounter, 8725 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4826 SdHoareTripleChecker+Valid, 13167 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:53,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4826 Valid, 13167 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:45:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-03-03 15:45:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2934. [2025-03-03 15:45:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2870 states have (on average 1.7836236933797909) internal successors, (5119), 2874 states have internal predecessors, (5119), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-03 15:45:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5216 transitions. [2025-03-03 15:45:53,313 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5216 transitions. Word has length 179 [2025-03-03 15:45:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:53,313 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5216 transitions. [2025-03-03 15:45:53,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5216 transitions. [2025-03-03 15:45:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:45:53,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:53,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:53,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:45:53,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1075683464, now seen corresponding path program 1 times [2025-03-03 15:45:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603455819] [2025-03-03 15:45:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:53,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:45:53,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:45:53,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:53,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:53,531 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:45:53,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:53,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603455819] [2025-03-03 15:45:53,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603455819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:53,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:53,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130458312] [2025-03-03 15:45:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:53,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:53,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:53,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:53,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:53,533 INFO L87 Difference]: Start difference. First operand 2934 states and 5216 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:54,293 INFO L93 Difference]: Finished difference Result 4235 states and 7264 transitions. [2025-03-03 15:45:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:54,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:45:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:54,311 INFO L225 Difference]: With dead ends: 4235 [2025-03-03 15:45:54,311 INFO L226 Difference]: Without dead ends: 3442 [2025-03-03 15:45:54,315 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:45:54,316 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 5176 mSDsluCounter, 13787 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5196 SdHoareTripleChecker+Valid, 18323 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:54,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5196 Valid, 18323 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:45:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-03-03 15:45:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3311. [2025-03-03 15:45:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3219 states have (on average 1.7552034793414104) internal successors, (5650), 3224 states have internal predecessors, (5650), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-03 15:45:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 5792 transitions. [2025-03-03 15:45:54,399 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 5792 transitions. Word has length 179 [2025-03-03 15:45:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:54,399 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 5792 transitions. [2025-03-03 15:45:54,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 5792 transitions. [2025-03-03 15:45:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:45:54,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:54,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:54,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:45:54,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:54,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash 770048935, now seen corresponding path program 1 times [2025-03-03 15:45:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624059869] [2025-03-03 15:45:54,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:54,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:54,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:45:54,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:45:54,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:54,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:54,583 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:45:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624059869] [2025-03-03 15:45:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624059869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:54,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433239609] [2025-03-03 15:45:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:54,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:54,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:54,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:54,586 INFO L87 Difference]: Start difference. First operand 3311 states and 5792 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:55,305 INFO L93 Difference]: Finished difference Result 5433 states and 9125 transitions. [2025-03-03 15:45:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:45:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:55,321 INFO L225 Difference]: With dead ends: 5433 [2025-03-03 15:45:55,321 INFO L226 Difference]: Without dead ends: 4263 [2025-03-03 15:45:55,325 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:45:55,325 INFO L435 NwaCegarLoop]: 4794 mSDtfsCounter, 5141 mSDsluCounter, 14460 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5161 SdHoareTripleChecker+Valid, 19254 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:55,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5161 Valid, 19254 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:45:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-03-03 15:45:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4112. [2025-03-03 15:45:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 3962 states have (on average 1.716052498738011) internal successors, (6799), 3971 states have internal predecessors, (6799), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-03 15:45:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 7037 transitions. [2025-03-03 15:45:55,495 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 7037 transitions. Word has length 179 [2025-03-03 15:45:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:55,496 INFO L471 AbstractCegarLoop]: Abstraction has 4112 states and 7037 transitions. [2025-03-03 15:45:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 7037 transitions. [2025-03-03 15:45:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:45:55,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:55,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:55,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:45:55,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:55,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash 67453096, now seen corresponding path program 1 times [2025-03-03 15:45:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761036699] [2025-03-03 15:45:55,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:55,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:45:55,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:45:55,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:55,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:55,797 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:45:55,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761036699] [2025-03-03 15:45:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761036699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623009565] [2025-03-03 15:45:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:55,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:55,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:55,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:55,802 INFO L87 Difference]: Start difference. First operand 4112 states and 7037 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:56,564 INFO L93 Difference]: Finished difference Result 8012 states and 13216 transitions. [2025-03-03 15:45:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:45:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:56,590 INFO L225 Difference]: With dead ends: 8012 [2025-03-03 15:45:56,591 INFO L226 Difference]: Without dead ends: 6041 [2025-03-03 15:45:56,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:45:56,600 INFO L435 NwaCegarLoop]: 4791 mSDtfsCounter, 5136 mSDsluCounter, 14451 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 19242 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:56,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 19242 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:45:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2025-03-03 15:45:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5849. [2025-03-03 15:45:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5849 states, 5577 states have (on average 1.675990675990676) internal successors, (9347), 5600 states have internal predecessors, (9347), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-03 15:45:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 9801 transitions. [2025-03-03 15:45:56,756 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 9801 transitions. Word has length 179 [2025-03-03 15:45:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:56,756 INFO L471 AbstractCegarLoop]: Abstraction has 5849 states and 9801 transitions. [2025-03-03 15:45:56,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:56,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 9801 transitions. [2025-03-03 15:45:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:45:56,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:56,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:56,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:45:56,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:56,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1014620039, now seen corresponding path program 1 times [2025-03-03 15:45:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411045943] [2025-03-03 15:45:56,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:56,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:45:56,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:45:56,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:56,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:56,972 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:45:56,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:56,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411045943] [2025-03-03 15:45:56,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411045943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:56,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:56,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132105565] [2025-03-03 15:45:56,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:56,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:56,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:56,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:56,976 INFO L87 Difference]: Start difference. First operand 5849 states and 9801 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:57,769 INFO L93 Difference]: Finished difference Result 13691 states and 22482 transitions. [2025-03-03 15:45:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:45:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:57,810 INFO L225 Difference]: With dead ends: 13691 [2025-03-03 15:45:57,810 INFO L226 Difference]: Without dead ends: 9983 [2025-03-03 15:45:57,826 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:45:57,828 INFO L435 NwaCegarLoop]: 4788 mSDtfsCounter, 5131 mSDsluCounter, 14442 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5151 SdHoareTripleChecker+Valid, 19230 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:57,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5151 Valid, 19230 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:45:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2025-03-03 15:45:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9710. [2025-03-03 15:45:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9710 states, 9176 states have (on average 1.652027027027027) internal successors, (15159), 9245 states have internal predecessors, (15159), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-03 15:45:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9710 states to 9710 states and 16141 transitions. [2025-03-03 15:45:58,179 INFO L78 Accepts]: Start accepts. Automaton has 9710 states and 16141 transitions. Word has length 179 [2025-03-03 15:45:58,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:58,179 INFO L471 AbstractCegarLoop]: Abstraction has 9710 states and 16141 transitions. [2025-03-03 15:45:58,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9710 states and 16141 transitions. [2025-03-03 15:45:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:45:58,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:58,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:58,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:45:58,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1737910472, now seen corresponding path program 1 times [2025-03-03 15:45:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821015923] [2025-03-03 15:45:58,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:58,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:45:58,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:45:58,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:58,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:58,347 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:45:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821015923] [2025-03-03 15:45:58,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821015923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:58,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:45:58,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:45:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701681625] [2025-03-03 15:45:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:58,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:45:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:58,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:45:58,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:58,348 INFO L87 Difference]: Start difference. First operand 9710 states and 16141 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:45:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:59,612 INFO L93 Difference]: Finished difference Result 26538 states and 44244 transitions. [2025-03-03 15:45:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:45:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:45:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:59,674 INFO L225 Difference]: With dead ends: 26538 [2025-03-03 15:45:59,675 INFO L226 Difference]: Without dead ends: 18969 [2025-03-03 15:45:59,704 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:45:59,706 INFO L435 NwaCegarLoop]: 4785 mSDtfsCounter, 5126 mSDsluCounter, 14433 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 19218 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:59,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 19218 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:45:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18969 states. [2025-03-03 15:46:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18969 to 18539. [2025-03-03 15:46:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6541573420554312) internal successors, (28827), 17642 states have internal predecessors, (28827), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:46:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31249 transitions. [2025-03-03 15:46:00,237 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31249 transitions. Word has length 179 [2025-03-03 15:46:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:00,237 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31249 transitions. [2025-03-03 15:46:00,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31249 transitions. [2025-03-03 15:46:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:00,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:00,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:46:00,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -871156889, now seen corresponding path program 1 times [2025-03-03 15:46:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259580800] [2025-03-03 15:46:00,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:00,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:00,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:00,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:00,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259580800] [2025-03-03 15:46:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259580800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:00,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:00,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630633530] [2025-03-03 15:46:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:00,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:00,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:00,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:00,367 INFO L87 Difference]: Start difference. First operand 18539 states and 31249 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:01,074 INFO L93 Difference]: Finished difference Result 39837 states and 68662 transitions. [2025-03-03 15:46:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:01,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:01,153 INFO L225 Difference]: With dead ends: 39837 [2025-03-03 15:46:01,154 INFO L226 Difference]: Without dead ends: 23439 [2025-03-03 15:46:01,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:01,278 INFO L435 NwaCegarLoop]: 4429 mSDtfsCounter, 4798 mSDsluCounter, 8700 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4818 SdHoareTripleChecker+Valid, 13129 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:01,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4818 Valid, 13129 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23439 states. [2025-03-03 15:46:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23439 to 18539. [2025-03-03 15:46:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6522637286968498) internal successors, (28794), 17642 states have internal predecessors, (28794), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:46:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31216 transitions. [2025-03-03 15:46:02,144 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31216 transitions. Word has length 179 [2025-03-03 15:46:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:02,145 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31216 transitions. [2025-03-03 15:46:02,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31216 transitions. [2025-03-03 15:46:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:02,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:02,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:46:02,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:02,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash -678225688, now seen corresponding path program 1 times [2025-03-03 15:46:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:02,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663074544] [2025-03-03 15:46:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:02,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:02,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:02,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:02,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:02,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663074544] [2025-03-03 15:46:02,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663074544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:02,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417537385] [2025-03-03 15:46:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:02,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:02,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:02,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:02,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:02,289 INFO L87 Difference]: Start difference. First operand 18539 states and 31216 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:03,138 INFO L93 Difference]: Finished difference Result 39592 states and 68106 transitions. [2025-03-03 15:46:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:03,269 INFO L225 Difference]: With dead ends: 39592 [2025-03-03 15:46:03,269 INFO L226 Difference]: Without dead ends: 23194 [2025-03-03 15:46:03,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:03,320 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4795 mSDsluCounter, 8695 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4815 SdHoareTripleChecker+Valid, 13121 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:03,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4815 Valid, 13121 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:46:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23194 states. [2025-03-03 15:46:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23194 to 18539. [2025-03-03 15:46:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18539 states, 17427 states have (on average 1.6503701153382682) internal successors, (28761), 17642 states have internal predecessors, (28761), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:46:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31183 transitions. [2025-03-03 15:46:04,185 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31183 transitions. Word has length 179 [2025-03-03 15:46:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:04,186 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31183 transitions. [2025-03-03 15:46:04,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31183 transitions. [2025-03-03 15:46:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:04,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:04,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:04,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:46:04,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:04,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash -810549433, now seen corresponding path program 1 times [2025-03-03 15:46:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590370535] [2025-03-03 15:46:04,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:04,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:04,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:04,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:04,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:04,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:04,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590370535] [2025-03-03 15:46:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590370535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:04,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:04,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027299018] [2025-03-03 15:46:04,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:04,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:04,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:04,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:04,401 INFO L87 Difference]: Start difference. First operand 18539 states and 31183 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:05,708 INFO L93 Difference]: Finished difference Result 55929 states and 96212 transitions. [2025-03-03 15:46:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:05,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:05,829 INFO L225 Difference]: With dead ends: 55929 [2025-03-03 15:46:05,829 INFO L226 Difference]: Without dead ends: 39531 [2025-03-03 15:46:05,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:05,870 INFO L435 NwaCegarLoop]: 4772 mSDtfsCounter, 5105 mSDsluCounter, 14396 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5125 SdHoareTripleChecker+Valid, 19168 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:05,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5125 Valid, 19168 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:46:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39531 states. [2025-03-03 15:46:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39531 to 38870. [2025-03-03 15:46:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.670609220636663) internal successors, (60877), 37109 states have internal predecessors, (60877), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:46:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67715 transitions. [2025-03-03 15:46:07,300 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67715 transitions. Word has length 179 [2025-03-03 15:46:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:07,301 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67715 transitions. [2025-03-03 15:46:07,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67715 transitions. [2025-03-03 15:46:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:07,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:07,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:07,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:46:07,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:07,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:07,319 INFO L85 PathProgramCache]: Analyzing trace with hash 155013384, now seen corresponding path program 1 times [2025-03-03 15:46:07,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:07,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121618195] [2025-03-03 15:46:07,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:07,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:07,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:07,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:07,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:07,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121618195] [2025-03-03 15:46:07,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121618195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:07,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:07,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599787284] [2025-03-03 15:46:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:07,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:07,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:07,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:07,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:07,441 INFO L87 Difference]: Start difference. First operand 38870 states and 67715 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:09,182 INFO L93 Difference]: Finished difference Result 88026 states and 158326 transitions. [2025-03-03 15:46:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:09,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:09,346 INFO L225 Difference]: With dead ends: 88026 [2025-03-03 15:46:09,346 INFO L226 Difference]: Without dead ends: 51297 [2025-03-03 15:46:09,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:09,426 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4822 mSDsluCounter, 8653 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 13041 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:09,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 13041 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:46:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51297 states. [2025-03-03 15:46:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51297 to 38870. [2025-03-03 15:46:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6688254665203073) internal successors, (60812), 37109 states have internal predecessors, (60812), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:46:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67650 transitions. [2025-03-03 15:46:10,739 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67650 transitions. Word has length 179 [2025-03-03 15:46:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:10,739 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67650 transitions. [2025-03-03 15:46:10,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67650 transitions. [2025-03-03 15:46:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:10,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:10,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:10,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:46:10,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:10,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:10,751 INFO L85 PathProgramCache]: Analyzing trace with hash -506576089, now seen corresponding path program 1 times [2025-03-03 15:46:10,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:10,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650973291] [2025-03-03 15:46:10,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:10,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:10,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:10,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:10,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650973291] [2025-03-03 15:46:10,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650973291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:10,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:10,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157989779] [2025-03-03 15:46:10,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:10,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:10,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:10,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:10,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:10,831 INFO L87 Difference]: Start difference. First operand 38870 states and 67650 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:12,502 INFO L93 Difference]: Finished difference Result 87295 states and 156734 transitions. [2025-03-03 15:46:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:12,721 INFO L225 Difference]: With dead ends: 87295 [2025-03-03 15:46:12,721 INFO L226 Difference]: Without dead ends: 50566 [2025-03-03 15:46:12,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:12,824 INFO L435 NwaCegarLoop]: 4418 mSDtfsCounter, 4788 mSDsluCounter, 8681 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4808 SdHoareTripleChecker+Valid, 13099 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:12,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4808 Valid, 13099 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50566 states. [2025-03-03 15:46:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50566 to 38870. [2025-03-03 15:46:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6670417124039516) internal successors, (60747), 37109 states have internal predecessors, (60747), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:46:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67585 transitions. [2025-03-03 15:46:14,816 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67585 transitions. Word has length 179 [2025-03-03 15:46:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67585 transitions. [2025-03-03 15:46:14,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67585 transitions. [2025-03-03 15:46:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:14,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:14,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:14,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:46:14,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:14,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash 441913640, now seen corresponding path program 1 times [2025-03-03 15:46:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805647920] [2025-03-03 15:46:14,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:14,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:14,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:14,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805647920] [2025-03-03 15:46:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805647920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:14,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:14,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457389452] [2025-03-03 15:46:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:14,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:14,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:14,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:14,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:14,932 INFO L87 Difference]: Start difference. First operand 38870 states and 67585 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:16,540 INFO L93 Difference]: Finished difference Result 86564 states and 155142 transitions. [2025-03-03 15:46:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:16,695 INFO L225 Difference]: With dead ends: 86564 [2025-03-03 15:46:16,695 INFO L226 Difference]: Without dead ends: 49835 [2025-03-03 15:46:16,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:16,768 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4785 mSDsluCounter, 8676 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4805 SdHoareTripleChecker+Valid, 13091 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:16,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4805 Valid, 13091 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:46:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49835 states. [2025-03-03 15:46:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49835 to 38870. [2025-03-03 15:46:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38870 states, 36440 states have (on average 1.6652579582875962) internal successors, (60682), 37109 states have internal predecessors, (60682), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:46:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67520 transitions. [2025-03-03 15:46:17,902 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67520 transitions. Word has length 179 [2025-03-03 15:46:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:17,902 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67520 transitions. [2025-03-03 15:46:17,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67520 transitions. [2025-03-03 15:46:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:17,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:17,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:17,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:46:17,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:17,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash 611057415, now seen corresponding path program 1 times [2025-03-03 15:46:17,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:17,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919082972] [2025-03-03 15:46:17,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:17,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:17,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:17,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:17,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919082972] [2025-03-03 15:46:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919082972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:18,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:18,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:18,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295720086] [2025-03-03 15:46:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:18,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:18,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:18,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:18,011 INFO L87 Difference]: Start difference. First operand 38870 states and 67520 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:21,723 INFO L93 Difference]: Finished difference Result 128758 states and 230926 transitions. [2025-03-03 15:46:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:22,159 INFO L225 Difference]: With dead ends: 128758 [2025-03-03 15:46:22,159 INFO L226 Difference]: Without dead ends: 92029 [2025-03-03 15:46:22,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:22,335 INFO L435 NwaCegarLoop]: 4752 mSDtfsCounter, 5450 mSDsluCounter, 14334 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5483 SdHoareTripleChecker+Valid, 19086 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:22,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5483 Valid, 19086 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:46:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92029 states. [2025-03-03 15:46:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92029 to 85172. [2025-03-03 15:46:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85172 states, 79684 states have (on average 1.6912805582049093) internal successors, (134768), 81747 states have internal predecessors, (134768), 2652 states have call successors, (2652), 775 states have call predecessors, (2652), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-03-03 15:46:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85172 states to 85172 states and 156454 transitions. [2025-03-03 15:46:25,674 INFO L78 Accepts]: Start accepts. Automaton has 85172 states and 156454 transitions. Word has length 179 [2025-03-03 15:46:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:25,675 INFO L471 AbstractCegarLoop]: Abstraction has 85172 states and 156454 transitions. [2025-03-03 15:46:25,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 85172 states and 156454 transitions. [2025-03-03 15:46:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:46:25,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:25,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:25,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:46:25,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:25,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1323148984, now seen corresponding path program 1 times [2025-03-03 15:46:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:25,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106877253] [2025-03-03 15:46:25,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:25,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:25,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:46:25,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:46:25,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:25,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:25,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106877253] [2025-03-03 15:46:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106877253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:25,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410182901] [2025-03-03 15:46:25,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:25,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:25,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:25,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:25,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:25,764 INFO L87 Difference]: Start difference. First operand 85172 states and 156454 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:29,429 INFO L93 Difference]: Finished difference Result 196660 states and 375906 transitions. [2025-03-03 15:46:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2025-03-03 15:46:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:29,925 INFO L225 Difference]: With dead ends: 196660 [2025-03-03 15:46:29,926 INFO L226 Difference]: Without dead ends: 113629 [2025-03-03 15:46:30,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:30,177 INFO L435 NwaCegarLoop]: 4410 mSDtfsCounter, 4779 mSDsluCounter, 8665 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4799 SdHoareTripleChecker+Valid, 13075 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:30,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4799 Valid, 13075 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113629 states.