./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label48+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c1e0608e097577ee5e32b08b857d6e2e7eb2349b5c9e07b4711539a549ac1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:06:16,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:06:16,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:06:16,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:06:16,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:06:16,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:06:16,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:06:16,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:06:16,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:06:16,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:06:16,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:06:16,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:06:16,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:06:16,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:06:16,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:06:16,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:06:16,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:06:16,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:06:16,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:06:16,978 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 -> 40c1e0608e097577ee5e32b08b857d6e2e7eb2349b5c9e07b4711539a549ac1d [2025-03-16 20:06:17,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:06:17,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:06:17,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:06:17,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:06:17,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:06:17,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c [2025-03-16 20:06:18,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc7607e9/891fd09e48ad49bbbca352f6b518dd77/FLAGf515c60fd [2025-03-16 20:06:18,831 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:06:18,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c [2025-03-16 20:06:18,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc7607e9/891fd09e48ad49bbbca352f6b518dd77/FLAGf515c60fd [2025-03-16 20:06:18,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcc7607e9/891fd09e48ad49bbbca352f6b518dd77 [2025-03-16 20:06:18,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:06:18,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:06:18,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:06:18,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:06:18,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:06:18,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:06:18" (1/1) ... [2025-03-16 20:06:18,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:18, skipping insertion in model container [2025-03-16 20:06:18,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:06:18" (1/1) ... [2025-03-16 20:06:19,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:06:20,109 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_label48+token_ring.07.cil-1.c[375709,375722] [2025-03-16 20:06:20,139 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_label48+token_ring.07.cil-1.c[383339,383352] [2025-03-16 20:06:20,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:06:20,346 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:06:20,830 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_label48+token_ring.07.cil-1.c[375709,375722] [2025-03-16 20:06:20,837 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_label48+token_ring.07.cil-1.c[383339,383352] [2025-03-16 20:06:20,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:06:20,896 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:06:20,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20 WrapperNode [2025-03-16 20:06:20,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:06:20,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:06:20,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:06:20,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:06:20,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:20,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,271 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-03-16 20:06:21,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:06:21,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:06:21,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:06:21,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:06:21,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,419 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-16 20:06:21,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:06:21,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:06:21,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:06:21,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:06:21,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (1/1) ... [2025-03-16 20:06:21,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:06:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:06:21,650 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-16 20:06:21,654 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-16 20:06:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:06:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:06:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:06:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:06:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:06:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:06:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:06:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:06:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:06:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:06:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:06:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:06:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:06:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:06:21,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:06:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:06:21,776 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:06:21,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:06:27,807 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:06:27,808 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:06:27,808 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:06:27,808 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:06:27,809 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:06:27,809 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:06:27,809 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:06:28,212 INFO L? ?]: Removed 1715 outVars from TransFormulas that were not future-live. [2025-03-16 20:06:28,213 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:06:28,294 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:06:28,294 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:06:28,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:06:28 BoogieIcfgContainer [2025-03-16 20:06:28,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:06:28,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:06:28,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:06:28,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:06:28,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:06:18" (1/3) ... [2025-03-16 20:06:28,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf8db50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:06:28, skipping insertion in model container [2025-03-16 20:06:28,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:06:20" (2/3) ... [2025-03-16 20:06:28,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf8db50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:06:28, skipping insertion in model container [2025-03-16 20:06:28,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:06:28" (3/3) ... [2025-03-16 20:06:28,308 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.07.cil-1.c [2025-03-16 20:06:28,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:06:28,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label48+token_ring.07.cil-1.c that has 7 procedures, 2364 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-16 20:06:28,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:06:28,403 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;@1ab72f96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:06:28,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:06:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 2364 states, 2335 states have (on average 1.871948608137045) internal successors, (4371), 2337 states have internal predecessors, (4371), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 20:06:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:28,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:28,420 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] [2025-03-16 20:06:28,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 160491844, now seen corresponding path program 1 times [2025-03-16 20:06:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452517206] [2025-03-16 20:06:28,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:28,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:28,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:28,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:28,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:28,932 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-16 20:06:28,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:28,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452517206] [2025-03-16 20:06:28,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452517206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:28,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:28,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:06:28,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63261958] [2025-03-16 20:06:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:28,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:06:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:28,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:06:28,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:06:28,963 INFO L87 Difference]: Start difference. First operand has 2364 states, 2335 states have (on average 1.871948608137045) internal successors, (4371), 2337 states have internal predecessors, (4371), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:29,433 INFO L93 Difference]: Finished difference Result 4730 states and 8834 transitions. [2025-03-16 20:06:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:06:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:29,460 INFO L225 Difference]: With dead ends: 4730 [2025-03-16 20:06:29,461 INFO L226 Difference]: Without dead ends: 2375 [2025-03-16 20:06:29,472 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-16 20:06:29,476 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 4462 mSDsluCounter, 8393 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 12642 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:29,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 12642 Invalid, 316 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:06:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2025-03-16 20:06:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2359. [2025-03-16 20:06:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2330 states have (on average 1.8416309012875536) internal successors, (4291), 2332 states have internal predecessors, (4291), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 20:06:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4333 transitions. [2025-03-16 20:06:29,597 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4333 transitions. Word has length 111 [2025-03-16 20:06:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:29,597 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4333 transitions. [2025-03-16 20:06:29,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4333 transitions. [2025-03-16 20:06:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:29,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:29,602 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] [2025-03-16 20:06:29,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:06:29,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash -648995613, now seen corresponding path program 1 times [2025-03-16 20:06:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203714285] [2025-03-16 20:06:29,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:29,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:29,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:29,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:29,779 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-16 20:06:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203714285] [2025-03-16 20:06:29,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203714285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:29,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:29,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:29,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126801088] [2025-03-16 20:06:29,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:29,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:29,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:29,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:29,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:29,781 INFO L87 Difference]: Start difference. First operand 2359 states and 4333 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:30,377 INFO L93 Difference]: Finished difference Result 2854 states and 5130 transitions. [2025-03-16 20:06:30,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:06:30,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:30,388 INFO L225 Difference]: With dead ends: 2854 [2025-03-16 20:06:30,388 INFO L226 Difference]: Without dead ends: 2629 [2025-03-16 20:06:30,391 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-16 20:06:30,392 INFO L435 NwaCegarLoop]: 4452 mSDtfsCounter, 4649 mSDsluCounter, 13447 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4664 SdHoareTripleChecker+Valid, 17899 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:30,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4664 Valid, 17899 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:06:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2025-03-16 20:06:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2597. [2025-03-16 20:06:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2542 states have (on average 1.8214004720692367) internal successors, (4630), 2546 states have internal predecessors, (4630), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-03-16 20:06:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4715 transitions. [2025-03-16 20:06:30,471 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4715 transitions. Word has length 111 [2025-03-16 20:06:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:30,472 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 4715 transitions. [2025-03-16 20:06:30,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4715 transitions. [2025-03-16 20:06:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:30,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:30,477 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] [2025-03-16 20:06:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:06:30,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:30,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1090750108, now seen corresponding path program 1 times [2025-03-16 20:06:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675181274] [2025-03-16 20:06:30,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:30,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:30,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:30,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:30,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:30,631 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-16 20:06:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675181274] [2025-03-16 20:06:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675181274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254023286] [2025-03-16 20:06:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:30,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:30,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:30,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:30,632 INFO L87 Difference]: Start difference. First operand 2597 states and 4715 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:31,121 INFO L93 Difference]: Finished difference Result 3564 states and 6271 transitions. [2025-03-16 20:06:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:06:31,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:31,134 INFO L225 Difference]: With dead ends: 3564 [2025-03-16 20:06:31,134 INFO L226 Difference]: Without dead ends: 3103 [2025-03-16 20:06:31,137 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-16 20:06:31,137 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4645 mSDsluCounter, 13369 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4660 SdHoareTripleChecker+Valid, 17784 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:31,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4660 Valid, 17784 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:06:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2025-03-16 20:06:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3059. [2025-03-16 20:06:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 2956 states have (on average 1.7892422192151556) internal successors, (5289), 2964 states have internal predecessors, (5289), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-16 20:06:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5454 transitions. [2025-03-16 20:06:31,217 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5454 transitions. Word has length 111 [2025-03-16 20:06:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:31,217 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 5454 transitions. [2025-03-16 20:06:31,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5454 transitions. [2025-03-16 20:06:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:31,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:31,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:06:31,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:06:31,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:31,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1105000253, now seen corresponding path program 1 times [2025-03-16 20:06:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743982524] [2025-03-16 20:06:31,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:31,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:31,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:31,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:31,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:31,405 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-16 20:06:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:31,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743982524] [2025-03-16 20:06:31,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743982524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:31,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:31,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650337268] [2025-03-16 20:06:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:31,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:31,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:31,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:31,408 INFO L87 Difference]: Start difference. First operand 3059 states and 5454 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:31,969 INFO L93 Difference]: Finished difference Result 5047 states and 8688 transitions. [2025-03-16 20:06:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:06:31,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:31,986 INFO L225 Difference]: With dead ends: 5047 [2025-03-16 20:06:31,986 INFO L226 Difference]: Without dead ends: 4124 [2025-03-16 20:06:31,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:06:31,992 INFO L435 NwaCegarLoop]: 4412 mSDtfsCounter, 4640 mSDsluCounter, 13356 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 17768 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:31,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 17768 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:06:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2025-03-16 20:06:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 4057. [2025-03-16 20:06:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4057 states, 3852 states have (on average 1.7484423676012462) internal successors, (6735), 3874 states have internal predecessors, (6735), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-03-16 20:06:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 7084 transitions. [2025-03-16 20:06:32,141 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 7084 transitions. Word has length 111 [2025-03-16 20:06:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:32,142 INFO L471 AbstractCegarLoop]: Abstraction has 4057 states and 7084 transitions. [2025-03-16 20:06:32,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 7084 transitions. [2025-03-16 20:06:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:32,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:32,145 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] [2025-03-16 20:06:32,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:06:32,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:32,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2075291260, now seen corresponding path program 1 times [2025-03-16 20:06:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:32,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448373815] [2025-03-16 20:06:32,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:32,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:32,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:32,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:32,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:32,264 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-16 20:06:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448373815] [2025-03-16 20:06:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448373815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:32,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:32,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028864342] [2025-03-16 20:06:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:32,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:32,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:32,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:32,266 INFO L87 Difference]: Start difference. First operand 4057 states and 7084 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:32,800 INFO L93 Difference]: Finished difference Result 8290 states and 14118 transitions. [2025-03-16 20:06:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:06:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:32,828 INFO L225 Difference]: With dead ends: 8290 [2025-03-16 20:06:32,829 INFO L226 Difference]: Without dead ends: 6369 [2025-03-16 20:06:32,837 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-16 20:06:32,838 INFO L435 NwaCegarLoop]: 4411 mSDtfsCounter, 4635 mSDsluCounter, 13345 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4650 SdHoareTripleChecker+Valid, 17756 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:32,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4650 Valid, 17756 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:06:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2025-03-16 20:06:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 6259. [2025-03-16 20:06:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6259 states, 5832 states have (on average 1.7114197530864197) internal successors, (9981), 5900 states have internal predecessors, (9981), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-03-16 20:06:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6259 states to 6259 states and 10794 transitions. [2025-03-16 20:06:33,060 INFO L78 Accepts]: Start accepts. Automaton has 6259 states and 10794 transitions. Word has length 111 [2025-03-16 20:06:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:33,061 INFO L471 AbstractCegarLoop]: Abstraction has 6259 states and 10794 transitions. [2025-03-16 20:06:33,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 6259 states and 10794 transitions. [2025-03-16 20:06:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:33,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:33,065 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] [2025-03-16 20:06:33,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:06:33,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1136759645, now seen corresponding path program 1 times [2025-03-16 20:06:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321424274] [2025-03-16 20:06:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:33,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:33,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:33,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:33,161 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-16 20:06:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:33,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321424274] [2025-03-16 20:06:33,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321424274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:33,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:33,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:33,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861540040] [2025-03-16 20:06:33,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:33,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:33,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:33,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:33,163 INFO L87 Difference]: Start difference. First operand 6259 states and 10794 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:33,835 INFO L93 Difference]: Finished difference Result 15541 states and 26760 transitions. [2025-03-16 20:06:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:06:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:33,893 INFO L225 Difference]: With dead ends: 15541 [2025-03-16 20:06:33,893 INFO L226 Difference]: Without dead ends: 11418 [2025-03-16 20:06:33,903 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-16 20:06:33,904 INFO L435 NwaCegarLoop]: 4408 mSDtfsCounter, 4630 mSDsluCounter, 13332 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 17740 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:33,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 17740 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:06:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11418 states. [2025-03-16 20:06:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11418 to 11229. [2025-03-16 20:06:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11229 states, 10304 states have (on average 1.6920613354037266) internal successors, (17435), 10518 states have internal predecessors, (17435), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 20:06:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11229 states to 11229 states and 19560 transitions. [2025-03-16 20:06:34,277 INFO L78 Accepts]: Start accepts. Automaton has 11229 states and 19560 transitions. Word has length 111 [2025-03-16 20:06:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:34,278 INFO L471 AbstractCegarLoop]: Abstraction has 11229 states and 19560 transitions. [2025-03-16 20:06:34,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 11229 states and 19560 transitions. [2025-03-16 20:06:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:34,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:34,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] [2025-03-16 20:06:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:06:34,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1522126428, now seen corresponding path program 1 times [2025-03-16 20:06:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603946028] [2025-03-16 20:06:34,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:34,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:34,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:34,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:34,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:06:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603946028] [2025-03-16 20:06:34,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603946028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:34,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:34,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:06:34,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546835710] [2025-03-16 20:06:34,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:34,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:06:34,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:34,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:06:34,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:06:34,374 INFO L87 Difference]: Start difference. First operand 11229 states and 19560 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:35,089 INFO L93 Difference]: Finished difference Result 22754 states and 40423 transitions. [2025-03-16 20:06:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:06:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:35,146 INFO L225 Difference]: With dead ends: 22754 [2025-03-16 20:06:35,147 INFO L226 Difference]: Without dead ends: 13659 [2025-03-16 20:06:35,179 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-16 20:06:35,179 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4448 mSDsluCounter, 8356 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 12586 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:35,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 12586 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:06:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13659 states. [2025-03-16 20:06:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13659 to 11229. [2025-03-16 20:06:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11229 states, 10304 states have (on average 1.6888586956521738) internal successors, (17402), 10518 states have internal predecessors, (17402), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 20:06:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11229 states to 11229 states and 19527 transitions. [2025-03-16 20:06:35,642 INFO L78 Accepts]: Start accepts. Automaton has 11229 states and 19527 transitions. Word has length 111 [2025-03-16 20:06:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:35,643 INFO L471 AbstractCegarLoop]: Abstraction has 11229 states and 19527 transitions. [2025-03-16 20:06:35,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11229 states and 19527 transitions. [2025-03-16 20:06:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:35,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:35,651 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] [2025-03-16 20:06:35,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:06:35,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:35,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:35,652 INFO L85 PathProgramCache]: Analyzing trace with hash 128010371, now seen corresponding path program 1 times [2025-03-16 20:06:35,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:35,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809477215] [2025-03-16 20:06:35,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:35,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:35,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:35,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:35,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:35,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:35,725 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-16 20:06:35,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:35,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809477215] [2025-03-16 20:06:35,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809477215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:35,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:35,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:06:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229420971] [2025-03-16 20:06:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:35,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:06:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:35,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:06:35,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:06:35,727 INFO L87 Difference]: Start difference. First operand 11229 states and 19527 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:36,391 INFO L93 Difference]: Finished difference Result 22268 states and 39385 transitions. [2025-03-16 20:06:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:06:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:36,444 INFO L225 Difference]: With dead ends: 22268 [2025-03-16 20:06:36,444 INFO L226 Difference]: Without dead ends: 13173 [2025-03-16 20:06:36,481 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-16 20:06:36,481 INFO L435 NwaCegarLoop]: 4225 mSDtfsCounter, 4442 mSDsluCounter, 8345 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4457 SdHoareTripleChecker+Valid, 12570 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:36,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4457 Valid, 12570 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:06:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13173 states. [2025-03-16 20:06:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13173 to 11229. [2025-03-16 20:06:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11229 states, 10304 states have (on average 1.685656055900621) internal successors, (17369), 10518 states have internal predecessors, (17369), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 20:06:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11229 states to 11229 states and 19494 transitions. [2025-03-16 20:06:37,075 INFO L78 Accepts]: Start accepts. Automaton has 11229 states and 19494 transitions. Word has length 111 [2025-03-16 20:06:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:37,076 INFO L471 AbstractCegarLoop]: Abstraction has 11229 states and 19494 transitions. [2025-03-16 20:06:37,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11229 states and 19494 transitions. [2025-03-16 20:06:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:37,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:37,084 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] [2025-03-16 20:06:37,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:06:37,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1296206626, now seen corresponding path program 1 times [2025-03-16 20:06:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:37,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24720218] [2025-03-16 20:06:37,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:37,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:37,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:37,186 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-16 20:06:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24720218] [2025-03-16 20:06:37,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24720218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:37,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:37,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675229499] [2025-03-16 20:06:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:37,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:37,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:37,188 INFO L87 Difference]: Start difference. First operand 11229 states and 19494 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:38,084 INFO L93 Difference]: Finished difference Result 32395 states and 57417 transitions. [2025-03-16 20:06:38,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:06:38,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:38,178 INFO L225 Difference]: With dead ends: 32395 [2025-03-16 20:06:38,178 INFO L226 Difference]: Without dead ends: 23302 [2025-03-16 20:06:38,210 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-16 20:06:38,213 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 4753 mSDsluCounter, 13260 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4776 SdHoareTripleChecker+Valid, 17652 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:38,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4776 Valid, 17652 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:06:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23302 states. [2025-03-16 20:06:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23302 to 21885. [2025-03-16 20:06:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21885 states, 19834 states have (on average 1.6774730261167692) internal successors, (33271), 20502 states have internal predecessors, (33271), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 20:06:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21885 states to 21885 states and 39492 transitions. [2025-03-16 20:06:39,104 INFO L78 Accepts]: Start accepts. Automaton has 21885 states and 39492 transitions. Word has length 111 [2025-03-16 20:06:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:39,104 INFO L471 AbstractCegarLoop]: Abstraction has 21885 states and 39492 transitions. [2025-03-16 20:06:39,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 21885 states and 39492 transitions. [2025-03-16 20:06:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:39,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:39,114 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] [2025-03-16 20:06:39,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:06:39,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash 86964387, now seen corresponding path program 1 times [2025-03-16 20:06:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339492650] [2025-03-16 20:06:39,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:39,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:39,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:39,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:39,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:39,199 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-16 20:06:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339492650] [2025-03-16 20:06:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339492650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:06:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297777735] [2025-03-16 20:06:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:06:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:39,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:06:39,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:06:39,201 INFO L87 Difference]: Start difference. First operand 21885 states and 39492 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:40,248 INFO L93 Difference]: Finished difference Result 46010 states and 85917 transitions. [2025-03-16 20:06:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:06:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:40,368 INFO L225 Difference]: With dead ends: 46010 [2025-03-16 20:06:40,368 INFO L226 Difference]: Without dead ends: 26259 [2025-03-16 20:06:40,425 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-16 20:06:40,426 INFO L435 NwaCegarLoop]: 4220 mSDtfsCounter, 4438 mSDsluCounter, 8336 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 12556 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:40,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 12556 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:06:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26259 states. [2025-03-16 20:06:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26259 to 21885. [2025-03-16 20:06:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21885 states, 19834 states have (on average 1.6741958253504083) internal successors, (33206), 20502 states have internal predecessors, (33206), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 20:06:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21885 states to 21885 states and 39427 transitions. [2025-03-16 20:06:42,060 INFO L78 Accepts]: Start accepts. Automaton has 21885 states and 39427 transitions. Word has length 111 [2025-03-16 20:06:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:42,060 INFO L471 AbstractCegarLoop]: Abstraction has 21885 states and 39427 transitions. [2025-03-16 20:06:42,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 21885 states and 39427 transitions. [2025-03-16 20:06:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:42,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:42,071 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] [2025-03-16 20:06:42,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:06:42,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:42,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1294882562, now seen corresponding path program 1 times [2025-03-16 20:06:42,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:42,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612165034] [2025-03-16 20:06:42,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:42,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:42,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:42,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:42,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:42,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:42,155 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-16 20:06:42,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:42,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612165034] [2025-03-16 20:06:42,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612165034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:42,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:42,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:06:42,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361288636] [2025-03-16 20:06:42,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:42,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:06:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:42,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:06:42,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:06:42,157 INFO L87 Difference]: Start difference. First operand 21885 states and 39427 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:43,018 INFO L93 Difference]: Finished difference Result 45281 states and 84329 transitions. [2025-03-16 20:06:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:06:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:43,229 INFO L225 Difference]: With dead ends: 45281 [2025-03-16 20:06:43,229 INFO L226 Difference]: Without dead ends: 25530 [2025-03-16 20:06:43,259 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-16 20:06:43,259 INFO L435 NwaCegarLoop]: 4217 mSDtfsCounter, 4435 mSDsluCounter, 8331 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 12548 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:43,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 12548 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:06:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25530 states. [2025-03-16 20:06:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25530 to 21885. [2025-03-16 20:06:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21885 states, 19834 states have (on average 1.6709186245840475) internal successors, (33141), 20502 states have internal predecessors, (33141), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 20:06:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21885 states to 21885 states and 39362 transitions. [2025-03-16 20:06:44,413 INFO L78 Accepts]: Start accepts. Automaton has 21885 states and 39362 transitions. Word has length 111 [2025-03-16 20:06:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:44,413 INFO L471 AbstractCegarLoop]: Abstraction has 21885 states and 39362 transitions. [2025-03-16 20:06:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 21885 states and 39362 transitions. [2025-03-16 20:06:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:44,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:44,423 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] [2025-03-16 20:06:44,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:06:44,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:44,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -190172989, now seen corresponding path program 1 times [2025-03-16 20:06:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:44,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260828409] [2025-03-16 20:06:44,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:44,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:44,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:44,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:44,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:44,512 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-16 20:06:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260828409] [2025-03-16 20:06:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260828409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636717392] [2025-03-16 20:06:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:44,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:44,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:44,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:44,514 INFO L87 Difference]: Start difference. First operand 21885 states and 39362 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:46,525 INFO L93 Difference]: Finished difference Result 65538 states and 124219 transitions. [2025-03-16 20:06:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:06:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:46,755 INFO L225 Difference]: With dead ends: 65538 [2025-03-16 20:06:46,755 INFO L226 Difference]: Without dead ends: 45789 [2025-03-16 20:06:46,824 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-16 20:06:46,824 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4651 mSDsluCounter, 13210 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4674 SdHoareTripleChecker+Valid, 17590 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:46,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4674 Valid, 17590 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:06:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45789 states. [2025-03-16 20:06:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45789 to 44311. [2025-03-16 20:06:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44311 states, 39554 states have (on average 1.6605905850230065) internal successors, (65683), 41616 states have internal predecessors, (65683), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-16 20:06:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44311 states to 44311 states and 86176 transitions. [2025-03-16 20:06:49,445 INFO L78 Accepts]: Start accepts. Automaton has 44311 states and 86176 transitions. Word has length 111 [2025-03-16 20:06:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:49,445 INFO L471 AbstractCegarLoop]: Abstraction has 44311 states and 86176 transitions. [2025-03-16 20:06:49,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 44311 states and 86176 transitions. [2025-03-16 20:06:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:49,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:49,462 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] [2025-03-16 20:06:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:06:49,462 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 593205986, now seen corresponding path program 1 times [2025-03-16 20:06:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997764072] [2025-03-16 20:06:49,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:49,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:49,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:49,534 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-16 20:06:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:49,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997764072] [2025-03-16 20:06:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997764072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:06:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897924782] [2025-03-16 20:06:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:49,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:06:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:49,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:06:49,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:06:49,536 INFO L87 Difference]: Start difference. First operand 44311 states and 86176 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:06:52,725 INFO L93 Difference]: Finished difference Result 93049 states and 191829 transitions. [2025-03-16 20:06:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:06:52,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:06:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:06:52,996 INFO L225 Difference]: With dead ends: 93049 [2025-03-16 20:06:52,996 INFO L226 Difference]: Without dead ends: 50872 [2025-03-16 20:06:53,130 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-16 20:06:53,131 INFO L435 NwaCegarLoop]: 4212 mSDtfsCounter, 4431 mSDsluCounter, 8322 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 12534 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:06:53,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 12534 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:06:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50872 states. [2025-03-16 20:06:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50872 to 44311. [2025-03-16 20:06:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44311 states, 39554 states have (on average 1.6573292208120545) internal successors, (65554), 41616 states have internal predecessors, (65554), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-16 20:06:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44311 states to 44311 states and 86047 transitions. [2025-03-16 20:06:56,712 INFO L78 Accepts]: Start accepts. Automaton has 44311 states and 86047 transitions. Word has length 111 [2025-03-16 20:06:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:06:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 44311 states and 86047 transitions. [2025-03-16 20:06:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:06:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 44311 states and 86047 transitions. [2025-03-16 20:06:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 20:06:56,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:06:56,726 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] [2025-03-16 20:06:56,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:06:56,726 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:06:56,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:06:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash 64286947, now seen corresponding path program 1 times [2025-03-16 20:06:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:06:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985843395] [2025-03-16 20:06:56,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:06:56,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:06:56,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 20:06:56,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 20:06:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:06:56,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:06:56,796 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-16 20:06:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:06:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985843395] [2025-03-16 20:06:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985843395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:06:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:06:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:06:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611590191] [2025-03-16 20:06:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:06:56,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:06:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:06:56,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:06:56,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:06:56,797 INFO L87 Difference]: Start difference. First operand 44311 states and 86047 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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-16 20:07:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:00,804 INFO L93 Difference]: Finished difference Result 133756 states and 286837 transitions. [2025-03-16 20:07:00,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:07:00,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2025-03-16 20:07:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:01,214 INFO L225 Difference]: With dead ends: 133756 [2025-03-16 20:07:01,215 INFO L226 Difference]: Without dead ends: 91581 [2025-03-16 20:07:01,351 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-16 20:07:01,351 INFO L435 NwaCegarLoop]: 4373 mSDtfsCounter, 4584 mSDsluCounter, 13179 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4607 SdHoareTripleChecker+Valid, 17552 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:01,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4607 Valid, 17552 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:07:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91581 states.