./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21399f6c1c6de0b812a418410b61643449f7872d7a63a6928748a1ba61200764 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:55:58,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:55:58,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:55:58,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:55:58,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:55:58,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:55:58,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:55:58,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:55:58,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:55:58,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:55:58,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:55:58,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:55:58,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:55:58,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:55:58,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:55:58,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:55:58,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:55:58,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:55:58,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:55:58,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:55:58,531 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:55:58,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:55:58,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:55:58,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:55:58,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:55:58,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:55:58,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:55:58,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:55:58,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21399f6c1c6de0b812a418410b61643449f7872d7a63a6928748a1ba61200764 [2025-03-08 06:55:58,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:55:58,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:55:58,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:55:58,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:55:58,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:55:58,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c [2025-03-08 06:55:59,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7552800b2/1a76c165f4c043d9ab55fa1e55a30e04/FLAGcddc5ea77 [2025-03-08 06:56:00,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:56:00,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c [2025-03-08 06:56:00,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7552800b2/1a76c165f4c043d9ab55fa1e55a30e04/FLAGcddc5ea77 [2025-03-08 06:56:00,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7552800b2/1a76c165f4c043d9ab55fa1e55a30e04 [2025-03-08 06:56:00,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:56:00,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:56:00,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:56:00,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:56:00,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:56:00,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:56:00" (1/1) ... [2025-03-08 06:56:00,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d88dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:00, skipping insertion in model container [2025-03-08 06:56:00,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:56:00" (1/1) ... [2025-03-08 06:56:00,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:56:01,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c[382357,382370] [2025-03-08 06:56:01,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c[383339,383352] [2025-03-08 06:56:01,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:56:01,912 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:56:02,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c[382357,382370] [2025-03-08 06:56:02,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.05.cil-2.c[383339,383352] [2025-03-08 06:56:02,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:56:02,537 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:56:02,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02 WrapperNode [2025-03-08 06:56:02,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:56:02,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:56:02,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:56:02,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:56:02,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:02,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:02,848 INFO L138 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 12792 [2025-03-08 06:56:02,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:56:02,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:56:02,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:56:02,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:56:02,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:02,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:02,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,032 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:56:03,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:56:03,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:56:03,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:56:03,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:56:03,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (1/1) ... [2025-03-08 06:56:03,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:56:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:03,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:56:03,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:56:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:56:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:56:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:56:03,504 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:56:03,505 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:56:09,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:56:09,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:56:09,504 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:56:09,504 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:56:09,504 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:56:09,504 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:56:09,504 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:56:09,846 INFO L? ?]: Removed 1717 outVars from TransFormulas that were not future-live. [2025-03-08 06:56:09,846 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:56:09,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:56:09,896 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:56:09,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:56:09 BoogieIcfgContainer [2025-03-08 06:56:09,896 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:56:09,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:56:09,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:56:09,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:56:09,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:56:00" (1/3) ... [2025-03-08 06:56:09,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3514eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:56:09, skipping insertion in model container [2025-03-08 06:56:09,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:56:02" (2/3) ... [2025-03-08 06:56:09,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3514eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:56:09, skipping insertion in model container [2025-03-08 06:56:09,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:56:09" (3/3) ... [2025-03-08 06:56:09,904 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.05.cil-2.c [2025-03-08 06:56:09,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:56:09,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.05.cil-2.c that has 8 procedures, 2396 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-08 06:56:10,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:56:10,029 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;@56e9b6f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:56:10,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:56:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 2396 states, 2366 states have (on average 1.849112426035503) internal successors, (4375), 2370 states have internal predecessors, (4375), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:56:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:10,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:10,054 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] [2025-03-08 06:56:10,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1085427139, now seen corresponding path program 1 times [2025-03-08 06:56:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:10,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895330841] [2025-03-08 06:56:10,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:10,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:10,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:10,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:10,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:10,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895330841] [2025-03-08 06:56:10,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895330841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:10,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:10,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:10,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060914597] [2025-03-08 06:56:10,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:10,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:10,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:10,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:10,526 INFO L87 Difference]: Start difference. First operand has 2396 states, 2366 states have (on average 1.849112426035503) internal successors, (4375), 2370 states have internal predecessors, (4375), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:11,043 INFO L93 Difference]: Finished difference Result 4995 states and 9165 transitions. [2025-03-08 06:56:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:56:11,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:11,067 INFO L225 Difference]: With dead ends: 4995 [2025-03-08 06:56:11,068 INFO L226 Difference]: Without dead ends: 2542 [2025-03-08 06:56:11,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:11,079 INFO L435 NwaCegarLoop]: 4275 mSDtfsCounter, 4593 mSDsluCounter, 8676 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 12951 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:11,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 12951 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:56:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-03-08 06:56:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2525. [2025-03-08 06:56:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2475 states have (on average 1.8234343434343434) internal successors, (4513), 2479 states have internal predecessors, (4513), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 06:56:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 4582 transitions. [2025-03-08 06:56:11,203 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 4582 transitions. Word has length 100 [2025-03-08 06:56:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:11,203 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 4582 transitions. [2025-03-08 06:56:11,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 4582 transitions. [2025-03-08 06:56:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:11,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:11,209 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] [2025-03-08 06:56:11,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:56:11,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:11,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1990305855, now seen corresponding path program 1 times [2025-03-08 06:56:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79422607] [2025-03-08 06:56:11,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:11,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:11,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79422607] [2025-03-08 06:56:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79422607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531017614] [2025-03-08 06:56:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:11,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:11,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:11,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:11,374 INFO L87 Difference]: Start difference. First operand 2525 states and 4582 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:11,698 INFO L93 Difference]: Finished difference Result 2952 states and 5255 transitions. [2025-03-08 06:56:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:11,708 INFO L225 Difference]: With dead ends: 2952 [2025-03-08 06:56:11,708 INFO L226 Difference]: Without dead ends: 2561 [2025-03-08 06:56:11,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:11,711 INFO L435 NwaCegarLoop]: 4194 mSDtfsCounter, 4369 mSDsluCounter, 8299 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4382 SdHoareTripleChecker+Valid, 12493 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:11,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4382 Valid, 12493 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:56:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-03-08 06:56:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2525. [2025-03-08 06:56:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2475 states have (on average 1.8226262626262626) internal successors, (4511), 2479 states have internal predecessors, (4511), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 06:56:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 4580 transitions. [2025-03-08 06:56:11,783 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 4580 transitions. Word has length 100 [2025-03-08 06:56:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:11,784 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 4580 transitions. [2025-03-08 06:56:11,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 4580 transitions. [2025-03-08 06:56:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:11,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:11,787 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] [2025-03-08 06:56:11,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:56:11,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash 819605890, now seen corresponding path program 1 times [2025-03-08 06:56:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045143137] [2025-03-08 06:56:11,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:11,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:11,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:11,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:11,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:11,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045143137] [2025-03-08 06:56:11,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045143137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:11,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:11,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:11,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568639177] [2025-03-08 06:56:11,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:11,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:11,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:11,955 INFO L87 Difference]: Start difference. First operand 2525 states and 4580 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:12,411 INFO L93 Difference]: Finished difference Result 3160 states and 5569 transitions. [2025-03-08 06:56:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:12,422 INFO L225 Difference]: With dead ends: 3160 [2025-03-08 06:56:12,422 INFO L226 Difference]: Without dead ends: 2769 [2025-03-08 06:56:12,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:12,424 INFO L435 NwaCegarLoop]: 4365 mSDtfsCounter, 4513 mSDsluCounter, 13086 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4526 SdHoareTripleChecker+Valid, 17451 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:12,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4526 Valid, 17451 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:56:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2025-03-08 06:56:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2708. [2025-03-08 06:56:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2637 states have (on average 1.8047023132347364) internal successors, (4759), 2642 states have internal predecessors, (4759), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-08 06:56:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 4859 transitions. [2025-03-08 06:56:12,486 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 4859 transitions. Word has length 100 [2025-03-08 06:56:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:12,486 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 4859 transitions. [2025-03-08 06:56:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 4859 transitions. [2025-03-08 06:56:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:12,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:12,487 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] [2025-03-08 06:56:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:56:12,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1602984865, now seen corresponding path program 1 times [2025-03-08 06:56:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081554654] [2025-03-08 06:56:12,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:12,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:12,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:12,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:12,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081554654] [2025-03-08 06:56:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081554654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124967232] [2025-03-08 06:56:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:12,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:12,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:12,601 INFO L87 Difference]: Start difference. First operand 2708 states and 4859 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:13,187 INFO L93 Difference]: Finished difference Result 3734 states and 6455 transitions. [2025-03-08 06:56:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:13,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:13,199 INFO L225 Difference]: With dead ends: 3734 [2025-03-08 06:56:13,199 INFO L226 Difference]: Without dead ends: 3160 [2025-03-08 06:56:13,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:13,202 INFO L435 NwaCegarLoop]: 4361 mSDtfsCounter, 4508 mSDsluCounter, 13074 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4521 SdHoareTripleChecker+Valid, 17435 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:13,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4521 Valid, 17435 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:56:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2025-03-08 06:56:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 3093. [2025-03-08 06:56:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 2978 states have (on average 1.7750167897918065) internal successors, (5286), 2987 states have internal predecessors, (5286), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-08 06:56:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 5454 transitions. [2025-03-08 06:56:13,284 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 5454 transitions. Word has length 100 [2025-03-08 06:56:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 3093 states and 5454 transitions. [2025-03-08 06:56:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 5454 transitions. [2025-03-08 06:56:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:13,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:13,287 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] [2025-03-08 06:56:13,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:56:13,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:13,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1074065826, now seen corresponding path program 1 times [2025-03-08 06:56:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014016640] [2025-03-08 06:56:13,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:13,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:13,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:13,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:13,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:13,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014016640] [2025-03-08 06:56:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014016640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:13,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:13,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416875639] [2025-03-08 06:56:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:13,388 INFO L87 Difference]: Start difference. First operand 3093 states and 5454 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:13,855 INFO L93 Difference]: Finished difference Result 4953 states and 8372 transitions. [2025-03-08 06:56:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:13,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:13,870 INFO L225 Difference]: With dead ends: 4953 [2025-03-08 06:56:13,870 INFO L226 Difference]: Without dead ends: 3994 [2025-03-08 06:56:13,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:13,875 INFO L435 NwaCegarLoop]: 4358 mSDtfsCounter, 4503 mSDsluCounter, 13065 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 17423 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:13,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 17423 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:56:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2025-03-08 06:56:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3914. [2025-03-08 06:56:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 3705 states have (on average 1.7333333333333334) internal successors, (6422), 3728 states have internal predecessors, (6422), 133 states have call successors, (133), 55 states have call predecessors, (133), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-08 06:56:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 6750 transitions. [2025-03-08 06:56:13,979 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 6750 transitions. Word has length 100 [2025-03-08 06:56:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:13,979 INFO L471 AbstractCegarLoop]: Abstraction has 3914 states and 6750 transitions. [2025-03-08 06:56:13,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 6750 transitions. [2025-03-08 06:56:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:13,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:13,982 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] [2025-03-08 06:56:13,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:56:13,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:13,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash 502814593, now seen corresponding path program 1 times [2025-03-08 06:56:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160201200] [2025-03-08 06:56:13,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:13,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:13,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:13,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:14,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160201200] [2025-03-08 06:56:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160201200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:14,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:14,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:14,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152716123] [2025-03-08 06:56:14,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:14,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:14,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:14,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:14,080 INFO L87 Difference]: Start difference. First operand 3914 states and 6750 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:14,820 INFO L93 Difference]: Finished difference Result 7858 states and 13023 transitions. [2025-03-08 06:56:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:14,848 INFO L225 Difference]: With dead ends: 7858 [2025-03-08 06:56:14,848 INFO L226 Difference]: Without dead ends: 6078 [2025-03-08 06:56:14,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:14,856 INFO L435 NwaCegarLoop]: 4349 mSDtfsCounter, 4659 mSDsluCounter, 13035 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4678 SdHoareTripleChecker+Valid, 17384 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:14,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4678 Valid, 17384 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:56:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2025-03-08 06:56:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 5640. [2025-03-08 06:56:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5640 states, 5233 states have (on average 1.688515192050449) internal successors, (8836), 5302 states have internal predecessors, (8836), 237 states have call successors, (237), 103 states have call predecessors, (237), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-08 06:56:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 9564 transitions. [2025-03-08 06:56:15,062 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 9564 transitions. Word has length 100 [2025-03-08 06:56:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:15,062 INFO L471 AbstractCegarLoop]: Abstraction has 5640 states and 9564 transitions. [2025-03-08 06:56:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 9564 transitions. [2025-03-08 06:56:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:15,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:15,066 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] [2025-03-08 06:56:15,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:56:15,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:15,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash 922331424, now seen corresponding path program 1 times [2025-03-08 06:56:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125658666] [2025-03-08 06:56:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:15,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:15,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:15,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:15,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125658666] [2025-03-08 06:56:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125658666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312161803] [2025-03-08 06:56:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:15,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:15,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:15,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:15,149 INFO L87 Difference]: Start difference. First operand 5640 states and 9564 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:15,509 INFO L93 Difference]: Finished difference Result 9644 states and 16188 transitions. [2025-03-08 06:56:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:15,536 INFO L225 Difference]: With dead ends: 9644 [2025-03-08 06:56:15,537 INFO L226 Difference]: Without dead ends: 6138 [2025-03-08 06:56:15,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:15,549 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4359 mSDsluCounter, 8272 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4372 SdHoareTripleChecker+Valid, 12453 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:15,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4372 Valid, 12453 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:56:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2025-03-08 06:56:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5640. [2025-03-08 06:56:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5640 states, 5233 states have (on average 1.685266577489012) internal successors, (8819), 5302 states have internal predecessors, (8819), 237 states have call successors, (237), 103 states have call predecessors, (237), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-08 06:56:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 9547 transitions. [2025-03-08 06:56:15,753 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 9547 transitions. Word has length 100 [2025-03-08 06:56:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 5640 states and 9547 transitions. [2025-03-08 06:56:15,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 9547 transitions. [2025-03-08 06:56:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:15,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:15,756 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] [2025-03-08 06:56:15,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:56:15,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:15,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:15,757 INFO L85 PathProgramCache]: Analyzing trace with hash 935864225, now seen corresponding path program 1 times [2025-03-08 06:56:15,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:15,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724413057] [2025-03-08 06:56:15,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:15,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:15,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:15,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:15,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:15,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:15,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:15,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724413057] [2025-03-08 06:56:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724413057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131785860] [2025-03-08 06:56:15,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:15,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:15,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:15,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:15,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:15,844 INFO L87 Difference]: Start difference. First operand 5640 states and 9547 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:16,502 INFO L93 Difference]: Finished difference Result 13366 states and 22248 transitions. [2025-03-08 06:56:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:16,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:16,546 INFO L225 Difference]: With dead ends: 13366 [2025-03-08 06:56:16,546 INFO L226 Difference]: Without dead ends: 9860 [2025-03-08 06:56:16,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:16,560 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4586 mSDsluCounter, 13012 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4605 SdHoareTripleChecker+Valid, 17353 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:16,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4605 Valid, 17353 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:56:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9860 states. [2025-03-08 06:56:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9860 to 9284. [2025-03-08 06:56:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9284 states, 8435 states have (on average 1.6451689389448725) internal successors, (13877), 8650 states have internal predecessors, (13877), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 06:56:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9284 states to 9284 states and 15773 transitions. [2025-03-08 06:56:17,209 INFO L78 Accepts]: Start accepts. Automaton has 9284 states and 15773 transitions. Word has length 100 [2025-03-08 06:56:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 9284 states and 15773 transitions. [2025-03-08 06:56:17,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9284 states and 15773 transitions. [2025-03-08 06:56:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:17,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:17,220 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] [2025-03-08 06:56:17,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:56:17,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:17,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2044679424, now seen corresponding path program 1 times [2025-03-08 06:56:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403999508] [2025-03-08 06:56:17,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:17,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:17,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:17,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:17,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:17,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:17,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403999508] [2025-03-08 06:56:17,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403999508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:17,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:17,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578005167] [2025-03-08 06:56:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:17,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:17,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:17,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:17,324 INFO L87 Difference]: Start difference. First operand 9284 states and 15773 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:17,780 INFO L93 Difference]: Finished difference Result 17414 states and 29884 transitions. [2025-03-08 06:56:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:17,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:17,815 INFO L225 Difference]: With dead ends: 17414 [2025-03-08 06:56:17,815 INFO L226 Difference]: Without dead ends: 10264 [2025-03-08 06:56:17,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:17,837 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4355 mSDsluCounter, 8263 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4368 SdHoareTripleChecker+Valid, 12439 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:17,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4368 Valid, 12439 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:56:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10264 states. [2025-03-08 06:56:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10264 to 9284. [2025-03-08 06:56:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9284 states, 8435 states have (on average 1.6412566686425607) internal successors, (13844), 8650 states have internal predecessors, (13844), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 06:56:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9284 states to 9284 states and 15740 transitions. [2025-03-08 06:56:18,255 INFO L78 Accepts]: Start accepts. Automaton has 9284 states and 15740 transitions. Word has length 100 [2025-03-08 06:56:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:18,255 INFO L471 AbstractCegarLoop]: Abstraction has 9284 states and 15740 transitions. [2025-03-08 06:56:18,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9284 states and 15740 transitions. [2025-03-08 06:56:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:18,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:18,260 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] [2025-03-08 06:56:18,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:56:18,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:18,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:18,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1383235647, now seen corresponding path program 1 times [2025-03-08 06:56:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:18,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219908118] [2025-03-08 06:56:18,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:18,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:18,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:18,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:18,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:18,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219908118] [2025-03-08 06:56:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219908118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:18,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:18,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:56:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783595317] [2025-03-08 06:56:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:18,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:56:18,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:18,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:56:18,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:56:18,328 INFO L87 Difference]: Start difference. First operand 9284 states and 15740 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:18,823 INFO L93 Difference]: Finished difference Result 17169 states and 29328 transitions. [2025-03-08 06:56:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:18,860 INFO L225 Difference]: With dead ends: 17169 [2025-03-08 06:56:18,860 INFO L226 Difference]: Without dead ends: 10019 [2025-03-08 06:56:18,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:18,882 INFO L435 NwaCegarLoop]: 4173 mSDtfsCounter, 4352 mSDsluCounter, 8258 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4365 SdHoareTripleChecker+Valid, 12431 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:18,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4365 Valid, 12431 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:56:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10019 states. [2025-03-08 06:56:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10019 to 9284. [2025-03-08 06:56:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9284 states, 8435 states have (on average 1.637344398340249) internal successors, (13811), 8650 states have internal predecessors, (13811), 437 states have call successors, (437), 199 states have call predecessors, (437), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 06:56:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9284 states to 9284 states and 15707 transitions. [2025-03-08 06:56:19,332 INFO L78 Accepts]: Start accepts. Automaton has 9284 states and 15707 transitions. Word has length 100 [2025-03-08 06:56:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:19,333 INFO L471 AbstractCegarLoop]: Abstraction has 9284 states and 15707 transitions. [2025-03-08 06:56:19,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9284 states and 15707 transitions. [2025-03-08 06:56:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:19,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:19,338 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] [2025-03-08 06:56:19,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:56:19,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:19,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash -939624224, now seen corresponding path program 1 times [2025-03-08 06:56:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109200667] [2025-03-08 06:56:19,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:19,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:19,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109200667] [2025-03-08 06:56:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109200667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:56:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149403414] [2025-03-08 06:56:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:19,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:56:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:19,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:56:19,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:19,432 INFO L87 Difference]: Start difference. First operand 9284 states and 15707 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:20,677 INFO L93 Difference]: Finished difference Result 24098 states and 41530 transitions. [2025-03-08 06:56:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:56:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-03-08 06:56:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:20,747 INFO L225 Difference]: With dead ends: 24098 [2025-03-08 06:56:20,747 INFO L226 Difference]: Without dead ends: 16948 [2025-03-08 06:56:20,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:56:20,768 INFO L435 NwaCegarLoop]: 4328 mSDtfsCounter, 4475 mSDsluCounter, 12975 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4494 SdHoareTripleChecker+Valid, 17303 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:20,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4494 Valid, 17303 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:56:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16948 states. [2025-03-08 06:56:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16948 to 16605. [2025-03-08 06:56:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16605 states, 14726 states have (on average 1.5952057585223414) internal successors, (23491), 15395 states have internal predecessors, (23491), 821 states have call successors, (821), 391 states have call predecessors, (821), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-08 06:56:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16605 states to 16605 states and 29227 transitions. [2025-03-08 06:56:21,535 INFO L78 Accepts]: Start accepts. Automaton has 16605 states and 29227 transitions. Word has length 100 [2025-03-08 06:56:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:21,535 INFO L471 AbstractCegarLoop]: Abstraction has 16605 states and 29227 transitions. [2025-03-08 06:56:21,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16605 states and 29227 transitions. [2025-03-08 06:56:21,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:56:21,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:21,544 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] [2025-03-08 06:56:21,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:56:21,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:21,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1895145503, now seen corresponding path program 1 times [2025-03-08 06:56:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:21,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747936999] [2025-03-08 06:56:21,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:21,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:56:21,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:56:21,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:21,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:56:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747936999] [2025-03-08 06:56:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747936999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:21,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:56:21,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:56:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852342827] [2025-03-08 06:56:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:21,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:56:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:21,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:56:21,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:56:21,596 INFO L87 Difference]: Start difference. First operand 16605 states and 29227 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:23,153 INFO L93 Difference]: Finished difference Result 44955 states and 79397 transitions. [2025-03-08 06:56:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:56:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2025-03-08 06:56:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:23,273 INFO L225 Difference]: With dead ends: 44955 [2025-03-08 06:56:23,273 INFO L226 Difference]: Without dead ends: 30485 [2025-03-08 06:56:23,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:56:23,317 INFO L435 NwaCegarLoop]: 4531 mSDtfsCounter, 4484 mSDsluCounter, 4458 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4484 SdHoareTripleChecker+Valid, 8989 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:23,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4484 Valid, 8989 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:56:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30485 states. [2025-03-08 06:56:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30485 to 30420. [2025-03-08 06:56:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30420 states, 26670 states have (on average 1.5564679415073115) internal successors, (41511), 28070 states have internal predecessors, (41511), 1636 states have call successors, (1636), 781 states have call predecessors, (1636), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-08 06:56:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30420 states to 30420 states and 52910 transitions. [2025-03-08 06:56:25,027 INFO L78 Accepts]: Start accepts. Automaton has 30420 states and 52910 transitions. Word has length 100 [2025-03-08 06:56:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:25,028 INFO L471 AbstractCegarLoop]: Abstraction has 30420 states and 52910 transitions. [2025-03-08 06:56:25,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:56:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 30420 states and 52910 transitions. [2025-03-08 06:56:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 06:56:25,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:25,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:25,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:56:25,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:25,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1143895324, now seen corresponding path program 1 times [2025-03-08 06:56:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137030932] [2025-03-08 06:56:25,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:25,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 06:56:25,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 06:56:25,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:25,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:56:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137030932] [2025-03-08 06:56:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137030932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465330365] [2025-03-08 06:56:25,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:25,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:25,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:25,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:25,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:56:25,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 06:56:25,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 06:56:25,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:25,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:25,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:56:25,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 06:56:25,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465330365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:25,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:25,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:56:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829238393] [2025-03-08 06:56:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:25,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:56:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:25,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:56:25,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:25,339 INFO L87 Difference]: Start difference. First operand 30420 states and 52910 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:56:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:27,915 INFO L93 Difference]: Finished difference Result 86339 states and 150514 transitions. [2025-03-08 06:56:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:56:27,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 162 [2025-03-08 06:56:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:28,212 INFO L225 Difference]: With dead ends: 86339 [2025-03-08 06:56:28,213 INFO L226 Difference]: Without dead ends: 58054 [2025-03-08 06:56:28,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:28,308 INFO L435 NwaCegarLoop]: 4267 mSDtfsCounter, 4217 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4217 SdHoareTripleChecker+Valid, 4548 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:28,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4217 Valid, 4548 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:56:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58054 states. [2025-03-08 06:56:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58054 to 57920. [2025-03-08 06:56:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57920 states, 50558 states have (on average 1.5429012223584793) internal successors, (78006), 53355 states have internal predecessors, (78006), 3136 states have call successors, (3136), 1561 states have call predecessors, (3136), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-08 06:56:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57920 states to 57920 states and 100471 transitions. [2025-03-08 06:56:31,294 INFO L78 Accepts]: Start accepts. Automaton has 57920 states and 100471 transitions. Word has length 162 [2025-03-08 06:56:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:31,295 INFO L471 AbstractCegarLoop]: Abstraction has 57920 states and 100471 transitions. [2025-03-08 06:56:31,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:56:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 57920 states and 100471 transitions. [2025-03-08 06:56:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 06:56:31,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:31,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:31,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:56:31,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:56:31,558 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:31,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash -427844906, now seen corresponding path program 1 times [2025-03-08 06:56:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:31,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025696830] [2025-03-08 06:56:31,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:31,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 06:56:31,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 06:56:31,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:31,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:56:31,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025696830] [2025-03-08 06:56:31,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025696830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236751999] [2025-03-08 06:56:31,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:31,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:31,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:31,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:31,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:56:31,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 06:56:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 06:56:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:31,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:56:31,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 06:56:31,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236751999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:56:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751573612] [2025-03-08 06:56:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:31,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:56:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:31,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:56:31,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:31,805 INFO L87 Difference]: Start difference. First operand 57920 states and 100471 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:56:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:56:36,878 INFO L93 Difference]: Finished difference Result 168189 states and 292877 transitions. [2025-03-08 06:56:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:56:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 162 [2025-03-08 06:56:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:56:37,421 INFO L225 Difference]: With dead ends: 168189 [2025-03-08 06:56:37,421 INFO L226 Difference]: Without dead ends: 112404 [2025-03-08 06:56:37,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:37,594 INFO L435 NwaCegarLoop]: 4267 mSDtfsCounter, 4211 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4211 SdHoareTripleChecker+Valid, 4548 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:56:37,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4211 Valid, 4548 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:56:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112404 states. [2025-03-08 06:56:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112404 to 112140. [2025-03-08 06:56:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112140 states, 97684 states have (on average 1.535113222226772) internal successors, (149956), 103275 states have internal predecessors, (149956), 6006 states have call successors, (6006), 3121 states have call predecessors, (6006), 8448 states have return successors, (38331), 5807 states have call predecessors, (38331), 6004 states have call successors, (38331) [2025-03-08 06:56:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112140 states to 112140 states and 194293 transitions. [2025-03-08 06:56:43,643 INFO L78 Accepts]: Start accepts. Automaton has 112140 states and 194293 transitions. Word has length 162 [2025-03-08 06:56:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:56:43,643 INFO L471 AbstractCegarLoop]: Abstraction has 112140 states and 194293 transitions. [2025-03-08 06:56:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:56:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 112140 states and 194293 transitions. [2025-03-08 06:56:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 06:56:43,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:56:43,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:56:43,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:56:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 06:56:43,956 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:56:43,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:56:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1327895568, now seen corresponding path program 1 times [2025-03-08 06:56:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:56:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123390595] [2025-03-08 06:56:43,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:43,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:56:43,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 06:56:43,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 06:56:43,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:43,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:56:44,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:56:44,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123390595] [2025-03-08 06:56:44,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123390595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:56:44,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098941153] [2025-03-08 06:56:44,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:56:44,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:56:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:56:44,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:56:44,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:56:44,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 06:56:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 06:56:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:56:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:56:44,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:56:44,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:56:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:56:44,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:56:44,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098941153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:56:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:56:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:56:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124749488] [2025-03-08 06:56:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:56:44,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:56:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:56:44,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:56:44,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:56:44,266 INFO L87 Difference]: Start difference. First operand 112140 states and 194293 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)