./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.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 c3f3364fd5ba51681dbe9ac9cfcd9f114289823313a53e53a305bf8ae66907c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:46:34,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:46:34,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:46:34,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:46:34,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:46:34,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:46:34,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:46:34,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:46:34,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:46:34,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:46:34,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:46:34,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:46:34,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:46:34,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:46:34,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:34,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:46:34,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:46:34,893 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 -> c3f3364fd5ba51681dbe9ac9cfcd9f114289823313a53e53a305bf8ae66907c7 [2025-03-03 15:46:35,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:46:35,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:46:35,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:46:35,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:46:35,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:46:35,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c [2025-03-03 15:46:36,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d354a2002/322c1fe4178c4672adb1d537a6fa0f1b/FLAG1a13ef9ac [2025-03-03 15:46:36,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:46:36,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c [2025-03-03 15:46:36,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d354a2002/322c1fe4178c4672adb1d537a6fa0f1b/FLAG1a13ef9ac [2025-03-03 15:46:36,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d354a2002/322c1fe4178c4672adb1d537a6fa0f1b [2025-03-03 15:46:36,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:46:36,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:46:36,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:36,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:46:36,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:46:36,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:36" (1/1) ... [2025-03-03 15:46:36,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7475c7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:36, skipping insertion in model container [2025-03-03 15:46:36,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:46:36" (1/1) ... [2025-03-03 15:46:37,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:46:38,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c[377612,377625] [2025-03-03 15:46:38,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c[383339,383352] [2025-03-03 15:46:38,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:38,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:46:38,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c[377612,377625] [2025-03-03 15:46:38,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.12.cil-2.c[383339,383352] [2025-03-03 15:46:38,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:46:39,032 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:46:39,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39 WrapperNode [2025-03-03 15:46:39,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:46:39,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:39,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:46:39,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:46:39,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,411 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13185 [2025-03-03 15:46:39,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:46:39,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:46:39,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:46:39,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:46:39,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,536 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:46:39,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:46:39,824 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:46:39,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:46:39,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:46:39,825 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (1/1) ... [2025-03-03 15:46:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:46:39,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:46:39,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:46:39,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:46:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:46:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:46:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:46:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:46:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:46:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:46:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:46:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:46:39,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:46:39,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:46:46,073 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:46:46,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:46:46,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:46:46,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:46:46,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:46:46,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:46:46,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:46:46,390 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2025-03-03 15:46:46,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:46:46,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:46:46,450 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:46:46,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:46 BoogieIcfgContainer [2025-03-03 15:46:46,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:46:46,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:46:46,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:46:46,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:46:46,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:46:36" (1/3) ... [2025-03-03 15:46:46,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26762dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:46, skipping insertion in model container [2025-03-03 15:46:46,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:46:39" (2/3) ... [2025-03-03 15:46:46,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26762dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:46:46, skipping insertion in model container [2025-03-03 15:46:46,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:46:46" (3/3) ... [2025-03-03 15:46:46,458 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.12.cil-2.c [2025-03-03 15:46:46,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:46:46,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.12.cil-2.c that has 7 procedures, 2591 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-03 15:46:46,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:46:46,582 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;@13653085, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:46:46,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:46:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 2591 states, 2556 states have (on average 1.828247261345853) internal successors, (4673), 2559 states have internal predecessors, (4673), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 15:46:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:46,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:46,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:46,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:46,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1913484464, now seen corresponding path program 1 times [2025-03-03 15:46:46,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76547391] [2025-03-03 15:46:46,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:46,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:46,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:46,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:46,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:47,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76547391] [2025-03-03 15:46:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76547391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:47,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:47,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352097785] [2025-03-03 15:46:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:47,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:47,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:47,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:47,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:47,190 INFO L87 Difference]: Start difference. First operand has 2591 states, 2556 states have (on average 1.828247261345853) internal successors, (4673), 2559 states have internal predecessors, (4673), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:48,002 INFO L93 Difference]: Finished difference Result 5596 states and 10117 transitions. [2025-03-03 15:46:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:46:48,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:48,033 INFO L225 Difference]: With dead ends: 5596 [2025-03-03 15:46:48,034 INFO L226 Difference]: Without dead ends: 2955 [2025-03-03 15:46:48,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:48,050 INFO L435 NwaCegarLoop]: 4516 mSDtfsCounter, 5202 mSDsluCounter, 9319 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 13835 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:48,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 13835 Invalid, 688 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:46:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2025-03-03 15:46:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2926. [2025-03-03 15:46:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2864 states have (on average 1.7838687150837989) internal successors, (5109), 2867 states have internal predecessors, (5109), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-03 15:46:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5204 transitions. [2025-03-03 15:46:48,210 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5204 transitions. Word has length 178 [2025-03-03 15:46:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:48,211 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5204 transitions. [2025-03-03 15:46:48,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5204 transitions. [2025-03-03 15:46:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:48,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:48,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:48,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:46:48,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -203993454, now seen corresponding path program 1 times [2025-03-03 15:46:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546097826] [2025-03-03 15:46:48,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:48,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:48,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:48,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:48,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:48,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546097826] [2025-03-03 15:46:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546097826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939887643] [2025-03-03 15:46:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:48,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:48,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:48,439 INFO L87 Difference]: Start difference. First operand 2926 states and 5204 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:48,832 INFO L93 Difference]: Finished difference Result 3789 states and 6569 transitions. [2025-03-03 15:46:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:48,844 INFO L225 Difference]: With dead ends: 3789 [2025-03-03 15:46:48,844 INFO L226 Difference]: Without dead ends: 3004 [2025-03-03 15:46:48,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:48,848 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4797 mSDsluCounter, 8715 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4817 SdHoareTripleChecker+Valid, 13150 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:48,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4817 Valid, 13150 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2025-03-03 15:46:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2926. [2025-03-03 15:46:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2864 states have (on average 1.7831703910614525) internal successors, (5107), 2867 states have internal predecessors, (5107), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-03 15:46:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5202 transitions. [2025-03-03 15:46:48,922 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5202 transitions. Word has length 178 [2025-03-03 15:46:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:48,922 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5202 transitions. [2025-03-03 15:46:48,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5202 transitions. [2025-03-03 15:46:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:48,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:48,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:46:48,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -509627983, now seen corresponding path program 1 times [2025-03-03 15:46:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60183610] [2025-03-03 15:46:48,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:48,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:49,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:49,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:49,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:49,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:49,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60183610] [2025-03-03 15:46:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60183610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606444511] [2025-03-03 15:46:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:49,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:49,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:49,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:49,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:49,210 INFO L87 Difference]: Start difference. First operand 2926 states and 5202 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:49,977 INFO L93 Difference]: Finished difference Result 4214 states and 7228 transitions. [2025-03-03 15:46:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:49,992 INFO L225 Difference]: With dead ends: 4214 [2025-03-03 15:46:49,992 INFO L226 Difference]: Without dead ends: 3429 [2025-03-03 15:46:49,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:49,996 INFO L435 NwaCegarLoop]: 4529 mSDtfsCounter, 5166 mSDsluCounter, 13765 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5186 SdHoareTripleChecker+Valid, 18294 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:49,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5186 Valid, 18294 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:46:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2025-03-03 15:46:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 3300. [2025-03-03 15:46:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3210 states have (on average 1.7545171339563863) internal successors, (5632), 3214 states have internal predecessors, (5632), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-03 15:46:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5772 transitions. [2025-03-03 15:46:50,102 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5772 transitions. Word has length 178 [2025-03-03 15:46:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5772 transitions. [2025-03-03 15:46:50,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5772 transitions. [2025-03-03 15:46:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:50,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:50,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:50,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:46:50,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:50,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1212223822, now seen corresponding path program 1 times [2025-03-03 15:46:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126683566] [2025-03-03 15:46:50,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:50,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:50,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:50,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:50,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:50,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126683566] [2025-03-03 15:46:50,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126683566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:50,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:50,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:50,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988451725] [2025-03-03 15:46:50,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:50,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:50,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:50,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:50,310 INFO L87 Difference]: Start difference. First operand 3300 states and 5772 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:51,108 INFO L93 Difference]: Finished difference Result 5403 states and 9071 transitions. [2025-03-03 15:46:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:51,126 INFO L225 Difference]: With dead ends: 5403 [2025-03-03 15:46:51,127 INFO L226 Difference]: Without dead ends: 4244 [2025-03-03 15:46:51,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:51,133 INFO L435 NwaCegarLoop]: 4780 mSDtfsCounter, 5132 mSDsluCounter, 14423 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5152 SdHoareTripleChecker+Valid, 19203 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:51,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5152 Valid, 19203 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:46:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2025-03-03 15:46:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 4095. [2025-03-03 15:46:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 3947 states have (on average 1.7149733975171015) internal successors, (6769), 3955 states have internal predecessors, (6769), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-03 15:46:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 7005 transitions. [2025-03-03 15:46:51,281 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 7005 transitions. Word has length 178 [2025-03-03 15:46:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:51,281 INFO L471 AbstractCegarLoop]: Abstraction has 4095 states and 7005 transitions. [2025-03-03 15:46:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 7005 transitions. [2025-03-03 15:46:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:51,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:51,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:51,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:46:51,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -265056879, now seen corresponding path program 1 times [2025-03-03 15:46:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906473017] [2025-03-03 15:46:51,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:51,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:51,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:51,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:51,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906473017] [2025-03-03 15:46:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906473017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:51,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555567865] [2025-03-03 15:46:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:51,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:51,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:51,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:51,462 INFO L87 Difference]: Start difference. First operand 4095 states and 7005 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:52,335 INFO L93 Difference]: Finished difference Result 7964 states and 13126 transitions. [2025-03-03 15:46:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:52,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:52,364 INFO L225 Difference]: With dead ends: 7964 [2025-03-03 15:46:52,365 INFO L226 Difference]: Without dead ends: 6010 [2025-03-03 15:46:52,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:52,375 INFO L435 NwaCegarLoop]: 4777 mSDtfsCounter, 5127 mSDsluCounter, 14414 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5147 SdHoareTripleChecker+Valid, 19191 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:52,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5147 Valid, 19191 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:46:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2025-03-03 15:46:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 5820. [2025-03-03 15:46:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5820 states, 5550 states have (on average 1.6744144144144144) internal successors, (9293), 5572 states have internal predecessors, (9293), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-03 15:46:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5820 states to 5820 states and 9745 transitions. [2025-03-03 15:46:52,604 INFO L78 Accepts]: Start accepts. Automaton has 5820 states and 9745 transitions. Word has length 178 [2025-03-03 15:46:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:52,606 INFO L471 AbstractCegarLoop]: Abstraction has 5820 states and 9745 transitions. [2025-03-03 15:46:52,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5820 states and 9745 transitions. [2025-03-03 15:46:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:52,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:52,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:52,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:46:52,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:52,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash 458233554, now seen corresponding path program 1 times [2025-03-03 15:46:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:52,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543376947] [2025-03-03 15:46:52,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:52,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:52,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:52,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:52,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:52,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543376947] [2025-03-03 15:46:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543376947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:52,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606036647] [2025-03-03 15:46:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:52,742 INFO L87 Difference]: Start difference. First operand 5820 states and 9745 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:53,600 INFO L93 Difference]: Finished difference Result 13607 states and 22320 transitions. [2025-03-03 15:46:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:53,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:53,640 INFO L225 Difference]: With dead ends: 13607 [2025-03-03 15:46:53,640 INFO L226 Difference]: Without dead ends: 9928 [2025-03-03 15:46:53,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:53,655 INFO L435 NwaCegarLoop]: 4774 mSDtfsCounter, 5122 mSDsluCounter, 14405 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5142 SdHoareTripleChecker+Valid, 19179 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:53,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5142 Valid, 19179 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:46:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9928 states. [2025-03-03 15:46:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9928 to 9657. [2025-03-03 15:46:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9657 states, 9125 states have (on average 1.650082191780822) internal successors, (15057), 9193 states have internal predecessors, (15057), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-03 15:46:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 16037 transitions. [2025-03-03 15:46:53,935 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 16037 transitions. Word has length 178 [2025-03-03 15:46:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:53,935 INFO L471 AbstractCegarLoop]: Abstraction has 9657 states and 16037 transitions. [2025-03-03 15:46:53,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 16037 transitions. [2025-03-03 15:46:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:53,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:53,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:53,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:46:53,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:53,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2144133489, now seen corresponding path program 1 times [2025-03-03 15:46:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734877787] [2025-03-03 15:46:53,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:53,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:53,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:53,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:53,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734877787] [2025-03-03 15:46:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734877787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498562848] [2025-03-03 15:46:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:54,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:54,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:54,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:54,071 INFO L87 Difference]: Start difference. First operand 9657 states and 16037 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:54,963 INFO L93 Difference]: Finished difference Result 26382 states and 43938 transitions. [2025-03-03 15:46:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:46:54,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:55,029 INFO L225 Difference]: With dead ends: 26382 [2025-03-03 15:46:55,030 INFO L226 Difference]: Without dead ends: 18866 [2025-03-03 15:46:55,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:46:55,063 INFO L435 NwaCegarLoop]: 4771 mSDtfsCounter, 5117 mSDsluCounter, 14396 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5137 SdHoareTripleChecker+Valid, 19167 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:55,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5137 Valid, 19167 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:46:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18866 states. [2025-03-03 15:46:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18866 to 18438. [2025-03-03 15:46:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6521814404432134) internal successors, (28629), 17542 states have internal predecessors, (28629), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:46:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 31049 transitions. [2025-03-03 15:46:55,626 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 31049 transitions. Word has length 178 [2025-03-03 15:46:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:55,626 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 31049 transitions. [2025-03-03 15:46:55,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 31049 transitions. [2025-03-03 15:46:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:55,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:55,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:55,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:46:55,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1957902606, now seen corresponding path program 1 times [2025-03-03 15:46:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:55,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875830870] [2025-03-03 15:46:55,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:55,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:55,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:55,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:55,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:55,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875830870] [2025-03-03 15:46:55,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875830870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:55,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:55,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766486078] [2025-03-03 15:46:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:55,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:55,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:55,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:55,747 INFO L87 Difference]: Start difference. First operand 18438 states and 31049 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:56,477 INFO L93 Difference]: Finished difference Result 39635 states and 68262 transitions. [2025-03-03 15:46:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:56,547 INFO L225 Difference]: With dead ends: 39635 [2025-03-03 15:46:56,547 INFO L226 Difference]: Without dead ends: 23338 [2025-03-03 15:46:56,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:56,586 INFO L435 NwaCegarLoop]: 4422 mSDtfsCounter, 4789 mSDsluCounter, 8690 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 13112 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:56,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 13112 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23338 states. [2025-03-03 15:46:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23338 to 18438. [2025-03-03 15:46:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6502770083102494) internal successors, (28596), 17542 states have internal predecessors, (28596), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:46:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 31016 transitions. [2025-03-03 15:46:57,129 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 31016 transitions. Word has length 178 [2025-03-03 15:46:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:57,130 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 31016 transitions. [2025-03-03 15:46:57,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 31016 transitions. [2025-03-03 15:46:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:57,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:57,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:57,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:46:57,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2090226351, now seen corresponding path program 1 times [2025-03-03 15:46:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:57,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371192944] [2025-03-03 15:46:57,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:57,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:57,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:57,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:57,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371192944] [2025-03-03 15:46:57,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371192944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:57,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:57,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:46:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956511612] [2025-03-03 15:46:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:57,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:46:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:57,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:46:57,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:46:57,248 INFO L87 Difference]: Start difference. First operand 18438 states and 31016 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:46:58,067 INFO L93 Difference]: Finished difference Result 39390 states and 67706 transitions. [2025-03-03 15:46:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:46:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:46:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:46:58,154 INFO L225 Difference]: With dead ends: 39390 [2025-03-03 15:46:58,154 INFO L226 Difference]: Without dead ends: 23093 [2025-03-03 15:46:58,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:58,198 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 4786 mSDsluCounter, 8685 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4806 SdHoareTripleChecker+Valid, 13104 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:46:58,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4806 Valid, 13104 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:46:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23093 states. [2025-03-03 15:46:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23093 to 18438. [2025-03-03 15:46:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18438 states, 17328 states have (on average 1.6483725761772854) internal successors, (28563), 17542 states have internal predecessors, (28563), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-03 15:46:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18438 states to 18438 states and 30983 transitions. [2025-03-03 15:46:58,930 INFO L78 Accepts]: Start accepts. Automaton has 18438 states and 30983 transitions. Word has length 178 [2025-03-03 15:46:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:46:58,931 INFO L471 AbstractCegarLoop]: Abstraction has 18438 states and 30983 transitions. [2025-03-03 15:46:58,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:46:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 18438 states and 30983 transitions. [2025-03-03 15:46:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:46:58,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:46:58,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:46:58,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:46:58,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:46:58,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:46:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1124663534, now seen corresponding path program 1 times [2025-03-03 15:46:58,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:46:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105116203] [2025-03-03 15:46:58,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:46:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:46:58,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:46:58,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:46:58,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:46:58,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:46:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:46:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:46:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105116203] [2025-03-03 15:46:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105116203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:46:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:46:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:46:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820565086] [2025-03-03 15:46:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:46:59,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:46:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:46:59,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:46:59,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:46:59,060 INFO L87 Difference]: Start difference. First operand 18438 states and 30983 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:47:00,352 INFO L93 Difference]: Finished difference Result 55629 states and 95618 transitions. [2025-03-03 15:47:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:47:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:47:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:47:00,480 INFO L225 Difference]: With dead ends: 55629 [2025-03-03 15:47:00,480 INFO L226 Difference]: Without dead ends: 39332 [2025-03-03 15:47:00,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:47:00,525 INFO L435 NwaCegarLoop]: 4758 mSDtfsCounter, 5096 mSDsluCounter, 14359 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 19117 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:47:00,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 19117 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:47:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39332 states. [2025-03-03 15:47:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39332 to 38673. [2025-03-03 15:47:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6688370809766864) internal successors, (60487), 36913 states have internal predecessors, (60487), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:47:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67323 transitions. [2025-03-03 15:47:01,635 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67323 transitions. Word has length 178 [2025-03-03 15:47:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:47:01,637 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67323 transitions. [2025-03-03 15:47:01,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67323 transitions. [2025-03-03 15:47:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:47:01,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:47:01,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:47:01,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:47:01,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:47:01,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:47:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1786253007, now seen corresponding path program 1 times [2025-03-03 15:47:01,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:47:01,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380737948] [2025-03-03 15:47:01,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:47:01,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:47:01,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:47:01,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:47:01,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:47:01,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:47:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:47:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:47:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380737948] [2025-03-03 15:47:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380737948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:47:01,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:47:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:47:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104341219] [2025-03-03 15:47:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:47:01,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:47:01,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:47:01,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:47:01,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:47:01,744 INFO L87 Difference]: Start difference. First operand 38673 states and 67323 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:47:02,974 INFO L93 Difference]: Finished difference Result 87632 states and 157542 transitions. [2025-03-03 15:47:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:47:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:47:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:47:03,169 INFO L225 Difference]: With dead ends: 87632 [2025-03-03 15:47:03,170 INFO L226 Difference]: Without dead ends: 51100 [2025-03-03 15:47:03,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:47:03,259 INFO L435 NwaCegarLoop]: 4381 mSDtfsCounter, 4813 mSDsluCounter, 8643 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4833 SdHoareTripleChecker+Valid, 13024 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:47:03,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4833 Valid, 13024 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:47:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51100 states. [2025-03-03 15:47:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51100 to 38673. [2025-03-03 15:47:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6670437301696786) internal successors, (60422), 36913 states have internal predecessors, (60422), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:47:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67258 transitions. [2025-03-03 15:47:05,346 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67258 transitions. Word has length 178 [2025-03-03 15:47:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:47:05,347 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67258 transitions. [2025-03-03 15:47:05,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67258 transitions. [2025-03-03 15:47:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:47:05,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:47:05,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:47:05,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:47:05,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:47:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:47:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash -837763278, now seen corresponding path program 1 times [2025-03-03 15:47:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:47:05,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885881651] [2025-03-03 15:47:05,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:47:05,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:47:05,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:47:05,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:47:05,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:47:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:47:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:47:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:47:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885881651] [2025-03-03 15:47:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885881651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:47:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:47:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:47:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385947372] [2025-03-03 15:47:05,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:47:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:47:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:47:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:47:05,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:47:05,478 INFO L87 Difference]: Start difference. First operand 38673 states and 67258 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:47:07,046 INFO L93 Difference]: Finished difference Result 86901 states and 155950 transitions. [2025-03-03 15:47:07,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:47:07,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:47:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:47:07,205 INFO L225 Difference]: With dead ends: 86901 [2025-03-03 15:47:07,206 INFO L226 Difference]: Without dead ends: 50369 [2025-03-03 15:47:07,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:47:07,277 INFO L435 NwaCegarLoop]: 4411 mSDtfsCounter, 4779 mSDsluCounter, 8671 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4799 SdHoareTripleChecker+Valid, 13082 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:47:07,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4799 Valid, 13082 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:47:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50369 states. [2025-03-03 15:47:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50369 to 38673. [2025-03-03 15:47:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.6652503793626707) internal successors, (60357), 36913 states have internal predecessors, (60357), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:47:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67193 transitions. [2025-03-03 15:47:08,568 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67193 transitions. Word has length 178 [2025-03-03 15:47:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:47:08,569 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67193 transitions. [2025-03-03 15:47:08,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67193 transitions. [2025-03-03 15:47:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:47:08,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:47:08,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:47:08,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:47:08,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:47:08,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:47:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash -668619503, now seen corresponding path program 1 times [2025-03-03 15:47:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:47:08,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150357138] [2025-03-03 15:47:08,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:47:08,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:47:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:47:08,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:47:08,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:47:08,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:47:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:47:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:47:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150357138] [2025-03-03 15:47:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150357138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:47:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:47:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:47:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018320774] [2025-03-03 15:47:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:47:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:47:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:47:08,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:47:08,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:47:08,666 INFO L87 Difference]: Start difference. First operand 38673 states and 67193 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:47:10,563 INFO L93 Difference]: Finished difference Result 86170 states and 154358 transitions. [2025-03-03 15:47:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:47:10,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:47:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:47:10,753 INFO L225 Difference]: With dead ends: 86170 [2025-03-03 15:47:10,754 INFO L226 Difference]: Without dead ends: 49638 [2025-03-03 15:47:10,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:47:10,862 INFO L435 NwaCegarLoop]: 4408 mSDtfsCounter, 4776 mSDsluCounter, 8666 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 13074 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:47:10,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 13074 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:47:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49638 states. [2025-03-03 15:47:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49638 to 38673. [2025-03-03 15:47:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38673 states, 36245 states have (on average 1.663457028555663) internal successors, (60292), 36913 states have internal predecessors, (60292), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-03 15:47:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38673 states to 38673 states and 67128 transitions. [2025-03-03 15:47:12,909 INFO L78 Accepts]: Start accepts. Automaton has 38673 states and 67128 transitions. Word has length 178 [2025-03-03 15:47:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:47:12,910 INFO L471 AbstractCegarLoop]: Abstraction has 38673 states and 67128 transitions. [2025-03-03 15:47:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 38673 states and 67128 transitions. [2025-03-03 15:47:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:47:12,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:47:12,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:47:12,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:47:12,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:47:12,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:47:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1692141394, now seen corresponding path program 1 times [2025-03-03 15:47:12,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:47:12,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736426855] [2025-03-03 15:47:12,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:47:12,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:47:12,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:47:12,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:47:12,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:47:12,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:47:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:47:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:47:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736426855] [2025-03-03 15:47:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736426855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:47:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:47:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:47:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348669291] [2025-03-03 15:47:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:47:13,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:47:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:47:13,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:47:13,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:47:13,042 INFO L87 Difference]: Start difference. First operand 38673 states and 67128 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:47:15,597 INFO L93 Difference]: Finished difference Result 128170 states and 229756 transitions. [2025-03-03 15:47:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:47:15,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:47:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:47:15,921 INFO L225 Difference]: With dead ends: 128170 [2025-03-03 15:47:15,921 INFO L226 Difference]: Without dead ends: 91638 [2025-03-03 15:47:16,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:47:16,047 INFO L435 NwaCegarLoop]: 4738 mSDtfsCounter, 5441 mSDsluCounter, 14297 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 19035 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:47:16,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 19035 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:47:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91638 states. [2025-03-03 15:47:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91638 to 84783. [2025-03-03 15:47:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84783 states, 79297 states have (on average 1.6897738880411617) internal successors, (133994), 81359 states have internal predecessors, (133994), 2650 states have call successors, (2650), 774 states have call predecessors, (2650), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-03-03 15:47:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84783 states to 84783 states and 155678 transitions. [2025-03-03 15:47:18,919 INFO L78 Accepts]: Start accepts. Automaton has 84783 states and 155678 transitions. Word has length 178 [2025-03-03 15:47:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:47:18,919 INFO L471 AbstractCegarLoop]: Abstraction has 84783 states and 155678 transitions. [2025-03-03 15:47:18,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 84783 states and 155678 transitions. [2025-03-03 15:47:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:47:18,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:47:18,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:47:18,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:47:18,936 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:47:18,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:47:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash -725557007, now seen corresponding path program 1 times [2025-03-03 15:47:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:47:18,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047173165] [2025-03-03 15:47:18,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:47:18,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:47:18,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:47:18,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:47:18,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:47:18,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:47:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:47:18,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:47:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047173165] [2025-03-03 15:47:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047173165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:47:19,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:47:19,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:47:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308241056] [2025-03-03 15:47:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:47:19,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:47:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:47:19,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:47:19,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:47:19,001 INFO L87 Difference]: Start difference. First operand 84783 states and 155678 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:47:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:47:23,286 INFO L93 Difference]: Finished difference Result 195882 states and 374354 transitions. [2025-03-03 15:47:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:47:23,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2025-03-03 15:47:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted.