./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-05 17:16:05,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:16:05,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:16:05,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:16:05,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:16:05,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:16:05,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:16:05,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:16:05,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:16:05,328 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:16:05,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:16:05,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:16:05,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:16:05,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:16:05,328 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:16:05,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:16:05,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:16:05,330 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:16:05,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:16:05,330 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:16:05,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:16:05,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:16:05,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:16:05,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:16:05,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:16:05,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:16:05,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:16:05,331 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-jdk21/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-02-05 17:16:05,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:16:05,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:16:05,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:16:05,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:16:05,537 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:16:05,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c [2025-02-05 17:16:06,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e435906d/992349629fc842829615a2bd65e4f802/FLAG969a9055a [2025-02-05 17:16:07,358 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:16:07,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c [2025-02-05 17:16:07,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e435906d/992349629fc842829615a2bd65e4f802/FLAG969a9055a [2025-02-05 17:16:07,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e435906d/992349629fc842829615a2bd65e4f802 [2025-02-05 17:16:07,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:16:07,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:16:07,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:16:07,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:16:07,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:16:07,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:16:07" (1/1) ... [2025-02-05 17:16:07,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2992ca7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:07, skipping insertion in model container [2025-02-05 17:16:07,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:16:07" (1/1) ... [2025-02-05 17:16:08,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:16:09,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c[382357,382370] [2025-02-05 17:16:09,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c[383339,383352] [2025-02-05 17:16:09,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:16:09,603 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:16:10,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c[382357,382370] [2025-02-05 17:16:10,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.14.cil.c[383339,383352] [2025-02-05 17:16:10,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:16:10,343 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:16:10,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10 WrapperNode [2025-02-05 17:16:10,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:16:10,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:16:10,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:16:10,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:16:10,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:10,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:10,857 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13189 [2025-02-05 17:16:10,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:16:10,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:16:10,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:16:10,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:16:10,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:10,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:10,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,101 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-02-05 17:16:11,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:16:11,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:16:11,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:16:11,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:16:11,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (1/1) ... [2025-02-05 17:16:11,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:16:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:16:11,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:16:11,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:16:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:16:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:16:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:16:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:16:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:16:11,472 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:16:11,472 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:16:11,472 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:16:11,472 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:16:11,472 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:16:11,472 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:16:11,472 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:16:11,472 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:16:11,472 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:16:11,472 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:16:11,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:16:11,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:16:11,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:16:11,596 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:16:11,598 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:16:17,954 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:16:17,955 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:16:17,956 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:16:17,956 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:16:17,956 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:16:17,956 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:16:17,957 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:16:18,234 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2025-02-05 17:16:18,234 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:16:18,310 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:16:18,311 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:16:18,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:16:18 BoogieIcfgContainer [2025-02-05 17:16:18,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:16:18,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:16:18,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:16:18,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:16:18,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:16:07" (1/3) ... [2025-02-05 17:16:18,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203a6a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:16:18, skipping insertion in model container [2025-02-05 17:16:18,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:10" (2/3) ... [2025-02-05 17:16:18,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203a6a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:16:18, skipping insertion in model container [2025-02-05 17:16:18,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:16:18" (3/3) ... [2025-02-05 17:16:18,321 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.14.cil.c [2025-02-05 17:16:18,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:16:18,340 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-02-05 17:16:18,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:16:18,456 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;@3a392e58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:16:18,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:16:18,469 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-02-05 17:16:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:18,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:18,482 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-02-05 17:16:18,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash 505805513, now seen corresponding path program 1 times [2025-02-05 17:16:18,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:18,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199975666] [2025-02-05 17:16:18,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:18,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:18,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:18,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:18,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:18,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199975666] [2025-02-05 17:16:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199975666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:19,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178869308] [2025-02-05 17:16:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:19,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:19,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:19,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:19,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:19,147 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-02-05 17:16:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:20,594 INFO L93 Difference]: Finished difference Result 5612 states and 10147 transitions. [2025-02-05 17:16:20,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:16:20,596 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-02-05 17:16:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:20,638 INFO L225 Difference]: With dead ends: 5612 [2025-02-05 17:16:20,638 INFO L226 Difference]: Without dead ends: 2965 [2025-02-05 17:16:20,653 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-02-05 17:16:20,658 INFO L435 NwaCegarLoop]: 4523 mSDtfsCounter, 5212 mSDsluCounter, 9336 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:20,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 13859 Invalid, 697 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 17:16:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-02-05 17:16:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2934. [2025-02-05 17:16:20,833 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-02-05 17:16:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5218 transitions. [2025-02-05 17:16:20,849 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5218 transitions. Word has length 179 [2025-02-05 17:16:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:20,850 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5218 transitions. [2025-02-05 17:16:20,850 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-02-05 17:16:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5218 transitions. [2025-02-05 17:16:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:20,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:20,854 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-02-05 17:16:20,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:16:20,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1960419271, now seen corresponding path program 1 times [2025-02-05 17:16:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514577524] [2025-02-05 17:16:20,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:20,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:20,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:20,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:20,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514577524] [2025-02-05 17:16:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514577524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579643086] [2025-02-05 17:16:21,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:21,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:21,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:21,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:21,120 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-02-05 17:16:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:21,553 INFO L93 Difference]: Finished difference Result 3805 states and 6597 transitions. [2025-02-05 17:16:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:21,554 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-02-05 17:16:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:21,567 INFO L225 Difference]: With dead ends: 3805 [2025-02-05 17:16:21,568 INFO L226 Difference]: Without dead ends: 3012 [2025-02-05 17:16:21,572 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-02-05 17:16:21,573 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-02-05 17:16:21,573 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-02-05 17:16:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-02-05 17:16:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2934. [2025-02-05 17:16:21,690 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-02-05 17:16:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5216 transitions. [2025-02-05 17:16:21,704 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5216 transitions. Word has length 179 [2025-02-05 17:16:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:21,704 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5216 transitions. [2025-02-05 17:16:21,704 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-02-05 17:16:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5216 transitions. [2025-02-05 17:16:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:21,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:21,707 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-02-05 17:16:21,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:16:21,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:21,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1075683464, now seen corresponding path program 1 times [2025-02-05 17:16:21,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:21,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460980230] [2025-02-05 17:16:21,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:21,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:21,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:21,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:21,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:21,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460980230] [2025-02-05 17:16:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460980230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217790464] [2025-02-05 17:16:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:21,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:21,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:21,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:21,996 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-02-05 17:16:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:22,817 INFO L93 Difference]: Finished difference Result 4235 states and 7264 transitions. [2025-02-05 17:16:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:22,819 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-02-05 17:16:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:22,840 INFO L225 Difference]: With dead ends: 4235 [2025-02-05 17:16:22,840 INFO L226 Difference]: Without dead ends: 3442 [2025-02-05 17:16:22,845 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-02-05 17:16:22,848 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:22,849 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.7s Time] [2025-02-05 17:16:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-05 17:16:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3311. [2025-02-05 17:16:22,955 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-02-05 17:16:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 5792 transitions. [2025-02-05 17:16:22,970 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 5792 transitions. Word has length 179 [2025-02-05 17:16:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:22,970 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 5792 transitions. [2025-02-05 17:16:22,971 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-02-05 17:16:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 5792 transitions. [2025-02-05 17:16:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:22,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:22,973 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-02-05 17:16:22,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:16:22,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 770048935, now seen corresponding path program 1 times [2025-02-05 17:16:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622188724] [2025-02-05 17:16:22,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:23,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:23,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:23,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:23,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622188724] [2025-02-05 17:16:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622188724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:23,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679832615] [2025-02-05 17:16:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:23,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:23,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:23,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:23,201 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-02-05 17:16:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:24,050 INFO L93 Difference]: Finished difference Result 5433 states and 9125 transitions. [2025-02-05 17:16:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:24,051 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-02-05 17:16:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:24,068 INFO L225 Difference]: With dead ends: 5433 [2025-02-05 17:16:24,069 INFO L226 Difference]: Without dead ends: 4263 [2025-02-05 17:16:24,074 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-02-05 17:16:24,075 INFO L435 NwaCegarLoop]: 4794 mSDtfsCounter, 5141 mSDsluCounter, 14460 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:24,075 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.7s Time] [2025-02-05 17:16:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-02-05 17:16:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4112. [2025-02-05 17:16:24,176 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-02-05 17:16:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 7037 transitions. [2025-02-05 17:16:24,187 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 7037 transitions. Word has length 179 [2025-02-05 17:16:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:24,187 INFO L471 AbstractCegarLoop]: Abstraction has 4112 states and 7037 transitions. [2025-02-05 17:16:24,188 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-02-05 17:16:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 7037 transitions. [2025-02-05 17:16:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:24,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:24,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-02-05 17:16:24,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:16:24,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash 67453096, now seen corresponding path program 1 times [2025-02-05 17:16:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:24,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329487422] [2025-02-05 17:16:24,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:24,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:24,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:24,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:24,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:24,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329487422] [2025-02-05 17:16:24,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329487422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:24,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:24,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:24,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250362573] [2025-02-05 17:16:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:24,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:24,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:24,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:24,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:24,396 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-02-05 17:16:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:25,078 INFO L93 Difference]: Finished difference Result 8012 states and 13216 transitions. [2025-02-05 17:16:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:25,078 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-02-05 17:16:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:25,097 INFO L225 Difference]: With dead ends: 8012 [2025-02-05 17:16:25,097 INFO L226 Difference]: Without dead ends: 6041 [2025-02-05 17:16:25,103 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-02-05 17:16:25,104 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-02-05 17:16:25,104 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-02-05 17:16:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2025-02-05 17:16:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5849. [2025-02-05 17:16:25,211 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-02-05 17:16:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 9801 transitions. [2025-02-05 17:16:25,221 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 9801 transitions. Word has length 179 [2025-02-05 17:16:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:25,221 INFO L471 AbstractCegarLoop]: Abstraction has 5849 states and 9801 transitions. [2025-02-05 17:16:25,222 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-02-05 17:16:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 9801 transitions. [2025-02-05 17:16:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:25,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:25,224 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-02-05 17:16:25,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:16:25,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:25,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1014620039, now seen corresponding path program 1 times [2025-02-05 17:16:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214101266] [2025-02-05 17:16:25,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:25,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:25,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:25,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:25,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214101266] [2025-02-05 17:16:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214101266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972260627] [2025-02-05 17:16:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:25,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:25,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:25,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:25,346 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-02-05 17:16:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:26,169 INFO L93 Difference]: Finished difference Result 13691 states and 22482 transitions. [2025-02-05 17:16:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:26,169 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-02-05 17:16:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:26,210 INFO L225 Difference]: With dead ends: 13691 [2025-02-05 17:16:26,210 INFO L226 Difference]: Without dead ends: 9983 [2025-02-05 17:16:26,220 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-02-05 17:16:26,221 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-02-05 17:16:26,222 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-02-05 17:16:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2025-02-05 17:16:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9710. [2025-02-05 17:16:26,415 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-02-05 17:16:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9710 states to 9710 states and 16141 transitions. [2025-02-05 17:16:26,436 INFO L78 Accepts]: Start accepts. Automaton has 9710 states and 16141 transitions. Word has length 179 [2025-02-05 17:16:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:26,436 INFO L471 AbstractCegarLoop]: Abstraction has 9710 states and 16141 transitions. [2025-02-05 17:16:26,437 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-02-05 17:16:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9710 states and 16141 transitions. [2025-02-05 17:16:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:26,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:26,442 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-02-05 17:16:26,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:16:26,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:26,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1737910472, now seen corresponding path program 1 times [2025-02-05 17:16:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:26,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467063175] [2025-02-05 17:16:26,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:26,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:26,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:26,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:26,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:26,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467063175] [2025-02-05 17:16:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467063175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225649305] [2025-02-05 17:16:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:26,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:26,581 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-02-05 17:16:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:28,053 INFO L93 Difference]: Finished difference Result 26538 states and 44244 transitions. [2025-02-05 17:16:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:28,055 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-02-05 17:16:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:28,116 INFO L225 Difference]: With dead ends: 26538 [2025-02-05 17:16:28,116 INFO L226 Difference]: Without dead ends: 18969 [2025-02-05 17:16:28,141 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-02-05 17:16:28,142 INFO L435 NwaCegarLoop]: 4785 mSDtfsCounter, 5126 mSDsluCounter, 14433 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:28,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 19218 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:16:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18969 states. [2025-02-05 17:16:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18969 to 18539. [2025-02-05 17:16:28,606 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-02-05 17:16:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31249 transitions. [2025-02-05 17:16:28,651 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31249 transitions. Word has length 179 [2025-02-05 17:16:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31249 transitions. [2025-02-05 17:16:28,651 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-02-05 17:16:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31249 transitions. [2025-02-05 17:16:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:28,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:28,658 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-02-05 17:16:28,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:16:28,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:28,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash -871156889, now seen corresponding path program 1 times [2025-02-05 17:16:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927428349] [2025-02-05 17:16:28,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:28,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:28,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:28,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:28,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:28,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927428349] [2025-02-05 17:16:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927428349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:28,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300541869] [2025-02-05 17:16:28,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:28,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:28,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:28,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:28,772 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-02-05 17:16:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:29,660 INFO L93 Difference]: Finished difference Result 39837 states and 68662 transitions. [2025-02-05 17:16:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:29,665 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-02-05 17:16:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:29,743 INFO L225 Difference]: With dead ends: 39837 [2025-02-05 17:16:29,743 INFO L226 Difference]: Without dead ends: 23439 [2025-02-05 17:16:29,795 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-02-05 17:16:29,795 INFO L435 NwaCegarLoop]: 4429 mSDtfsCounter, 4798 mSDsluCounter, 8700 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-05 17:16:29,796 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-02-05 17:16:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23439 states. [2025-02-05 17:16:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23439 to 18539. [2025-02-05 17:16:30,406 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-02-05 17:16:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31216 transitions. [2025-02-05 17:16:30,457 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31216 transitions. Word has length 179 [2025-02-05 17:16:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:30,458 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31216 transitions. [2025-02-05 17:16:30,458 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-02-05 17:16:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31216 transitions. [2025-02-05 17:16:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:30,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:30,466 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-02-05 17:16:30,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:16:30,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:30,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:30,466 INFO L85 PathProgramCache]: Analyzing trace with hash -678225688, now seen corresponding path program 1 times [2025-02-05 17:16:30,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:30,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749181461] [2025-02-05 17:16:30,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:30,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:30,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:30,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:30,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:30,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:30,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749181461] [2025-02-05 17:16:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749181461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:30,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249914577] [2025-02-05 17:16:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:30,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:30,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:30,566 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-02-05 17:16:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:31,314 INFO L93 Difference]: Finished difference Result 39592 states and 68106 transitions. [2025-02-05 17:16:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:31,314 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-02-05 17:16:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:31,376 INFO L225 Difference]: With dead ends: 39592 [2025-02-05 17:16:31,376 INFO L226 Difference]: Without dead ends: 23194 [2025-02-05 17:16:31,408 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-02-05 17:16:31,409 INFO L435 NwaCegarLoop]: 4426 mSDtfsCounter, 4795 mSDsluCounter, 8695 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:31,409 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.3s Time] [2025-02-05 17:16:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23194 states. [2025-02-05 17:16:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23194 to 18539. [2025-02-05 17:16:32,017 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-02-05 17:16:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 31183 transitions. [2025-02-05 17:16:32,064 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 31183 transitions. Word has length 179 [2025-02-05 17:16:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:32,064 INFO L471 AbstractCegarLoop]: Abstraction has 18539 states and 31183 transitions. [2025-02-05 17:16:32,064 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-02-05 17:16:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 31183 transitions. [2025-02-05 17:16:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:32,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:32,072 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-02-05 17:16:32,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:16:32,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:32,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -810549433, now seen corresponding path program 1 times [2025-02-05 17:16:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:32,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987740020] [2025-02-05 17:16:32,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:32,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:32,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:32,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:32,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:32,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987740020] [2025-02-05 17:16:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987740020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930459500] [2025-02-05 17:16:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:32,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:32,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:32,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:32,220 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-02-05 17:16:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:33,989 INFO L93 Difference]: Finished difference Result 55929 states and 96212 transitions. [2025-02-05 17:16:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:33,989 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-02-05 17:16:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:34,138 INFO L225 Difference]: With dead ends: 55929 [2025-02-05 17:16:34,139 INFO L226 Difference]: Without dead ends: 39531 [2025-02-05 17:16:34,331 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-02-05 17:16:34,331 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:34,331 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.7s Time] [2025-02-05 17:16:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39531 states. [2025-02-05 17:16:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39531 to 38870. [2025-02-05 17:16:35,275 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-02-05 17:16:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67715 transitions. [2025-02-05 17:16:35,615 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67715 transitions. Word has length 179 [2025-02-05 17:16:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:35,617 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67715 transitions. [2025-02-05 17:16:35,617 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-02-05 17:16:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67715 transitions. [2025-02-05 17:16:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:35,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:35,629 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-02-05 17:16:35,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:16:35,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:35,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 155013384, now seen corresponding path program 1 times [2025-02-05 17:16:35,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:35,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216745462] [2025-02-05 17:16:35,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:35,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:35,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:35,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216745462] [2025-02-05 17:16:35,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216745462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:35,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905859338] [2025-02-05 17:16:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:35,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:35,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:35,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:35,734 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-02-05 17:16:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:37,642 INFO L93 Difference]: Finished difference Result 88026 states and 158326 transitions. [2025-02-05 17:16:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:37,643 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-02-05 17:16:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:37,799 INFO L225 Difference]: With dead ends: 88026 [2025-02-05 17:16:37,799 INFO L226 Difference]: Without dead ends: 51297 [2025-02-05 17:16:37,868 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-02-05 17:16:37,868 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-02-05 17:16:37,869 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-02-05 17:16:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51297 states. [2025-02-05 17:16:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51297 to 38870. [2025-02-05 17:16:39,567 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-02-05 17:16:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67650 transitions. [2025-02-05 17:16:39,684 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67650 transitions. Word has length 179 [2025-02-05 17:16:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:39,686 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67650 transitions. [2025-02-05 17:16:39,686 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-02-05 17:16:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67650 transitions. [2025-02-05 17:16:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:39,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:39,698 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-02-05 17:16:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:16:39,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:39,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -506576089, now seen corresponding path program 1 times [2025-02-05 17:16:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418266756] [2025-02-05 17:16:39,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:39,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:39,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:39,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:39,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:39,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:39,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418266756] [2025-02-05 17:16:39,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418266756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:39,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:39,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:39,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855467412] [2025-02-05 17:16:39,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:39,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:39,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:39,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:39,811 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-02-05 17:16:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:41,870 INFO L93 Difference]: Finished difference Result 87295 states and 156734 transitions. [2025-02-05 17:16:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:41,870 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-02-05 17:16:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:42,228 INFO L225 Difference]: With dead ends: 87295 [2025-02-05 17:16:42,228 INFO L226 Difference]: Without dead ends: 50566 [2025-02-05 17:16:42,284 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-02-05 17:16:42,285 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.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:42,285 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.5s Time] [2025-02-05 17:16:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50566 states. [2025-02-05 17:16:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50566 to 38870. [2025-02-05 17:16:43,719 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-02-05 17:16:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67585 transitions. [2025-02-05 17:16:43,837 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67585 transitions. Word has length 179 [2025-02-05 17:16:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67585 transitions. [2025-02-05 17:16:43,838 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-02-05 17:16:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67585 transitions. [2025-02-05 17:16:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:43,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:43,848 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-02-05 17:16:43,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:16:43,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:43,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash 441913640, now seen corresponding path program 1 times [2025-02-05 17:16:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:43,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843161696] [2025-02-05 17:16:43,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:43,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:43,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:43,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:43,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:44,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:44,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843161696] [2025-02-05 17:16:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843161696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:44,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724165125] [2025-02-05 17:16:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:44,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:44,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:44,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:44,120 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-02-05 17:16:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:46,090 INFO L93 Difference]: Finished difference Result 86564 states and 155142 transitions. [2025-02-05 17:16:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:46,091 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-02-05 17:16:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:46,310 INFO L225 Difference]: With dead ends: 86564 [2025-02-05 17:16:46,310 INFO L226 Difference]: Without dead ends: 49835 [2025-02-05 17:16:46,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:46,430 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:46,430 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.3s Time] [2025-02-05 17:16:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49835 states. [2025-02-05 17:16:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49835 to 38870. [2025-02-05 17:16:48,060 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-02-05 17:16:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38870 states to 38870 states and 67520 transitions. [2025-02-05 17:16:48,204 INFO L78 Accepts]: Start accepts. Automaton has 38870 states and 67520 transitions. Word has length 179 [2025-02-05 17:16:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:48,204 INFO L471 AbstractCegarLoop]: Abstraction has 38870 states and 67520 transitions. [2025-02-05 17:16:48,204 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-02-05 17:16:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 38870 states and 67520 transitions. [2025-02-05 17:16:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:48,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:48,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:16:48,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:16:48,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 611057415, now seen corresponding path program 1 times [2025-02-05 17:16:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404601929] [2025-02-05 17:16:48,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:48,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:48,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:48,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:48,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:48,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:48,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404601929] [2025-02-05 17:16:48,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404601929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:48,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:48,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:48,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443585422] [2025-02-05 17:16:48,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:48,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:48,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:48,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:48,403 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-02-05 17:16:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:51,861 INFO L93 Difference]: Finished difference Result 128758 states and 230926 transitions. [2025-02-05 17:16:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:51,861 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-02-05 17:16:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:52,394 INFO L225 Difference]: With dead ends: 128758 [2025-02-05 17:16:52,394 INFO L226 Difference]: Without dead ends: 92029 [2025-02-05 17:16:52,472 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-02-05 17:16:52,473 INFO L435 NwaCegarLoop]: 4752 mSDtfsCounter, 5450 mSDsluCounter, 14334 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:52,473 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.7s Time] [2025-02-05 17:16:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92029 states. [2025-02-05 17:16:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92029 to 85172. [2025-02-05 17:16:55,573 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-02-05 17:16:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85172 states to 85172 states and 156454 transitions. [2025-02-05 17:16:55,945 INFO L78 Accepts]: Start accepts. Automaton has 85172 states and 156454 transitions. Word has length 179 [2025-02-05 17:16:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:55,946 INFO L471 AbstractCegarLoop]: Abstraction has 85172 states and 156454 transitions. [2025-02-05 17:16:55,946 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-02-05 17:16:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 85172 states and 156454 transitions. [2025-02-05 17:16:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:16:55,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:55,962 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-02-05 17:16:55,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:16:55,963 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1323148984, now seen corresponding path program 1 times [2025-02-05 17:16:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030037998] [2025-02-05 17:16:55,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:55,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:16:55,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:16:55,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:55,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:16:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030037998] [2025-02-05 17:16:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030037998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:56,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360554425] [2025-02-05 17:16:56,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:56,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:56,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:56,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:56,124 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-02-05 17:17:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:00,114 INFO L93 Difference]: Finished difference Result 196660 states and 375906 transitions. [2025-02-05 17:17:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:17:00,115 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-02-05 17:17:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:00,593 INFO L225 Difference]: With dead ends: 196660 [2025-02-05 17:17:00,593 INFO L226 Difference]: Without dead ends: 113629 [2025-02-05 17:17:00,835 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-02-05 17:17:00,835 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-02-05 17:17:00,836 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-02-05 17:17:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113629 states. [2025-02-05 17:17:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113629 to 85172. [2025-02-05 17:17:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85172 states, 79684 states have (on average 1.689661663571106) internal successors, (134639), 81747 states have internal predecessors, (134639), 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)