./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c713aa7938ec5ae1ba06a0e41e275f2f1d72befd88a887a14dfcd6cc53c5088 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:53:21,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:53:21,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:53:21,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:53:21,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:53:21,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:53:21,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:53:21,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:53:21,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:53:21,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:53:21,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:53:21,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:53:21,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:53:21,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:53:21,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:53:21,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:53:21,233 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:53:21,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:53:21,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:53:21,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:53:21,235 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 -> 7c713aa7938ec5ae1ba06a0e41e275f2f1d72befd88a887a14dfcd6cc53c5088 [2025-03-08 06:53:21,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:53:21,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:53:21,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:53:21,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:53:21,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:53:21,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.11.cil-2.c [2025-03-08 06:53:22,555 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc8bc92f/2dfd1e864cbc401a9ed4efd7a6f10e89/FLAGf4100f6c6 [2025-03-08 06:53:23,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:53:23,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.11.cil-2.c [2025-03-08 06:53:23,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc8bc92f/2dfd1e864cbc401a9ed4efd7a6f10e89/FLAGf4100f6c6 [2025-03-08 06:53:23,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc8bc92f/2dfd1e864cbc401a9ed4efd7a6f10e89 [2025-03-08 06:53:23,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:53:23,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:53:23,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:53:23,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:53:23,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:53:23,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:53:23" (1/1) ... [2025-03-08 06:53:23,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4007c5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:23, skipping insertion in model container [2025-03-08 06:53:23,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:53:23" (1/1) ... [2025-03-08 06:53:23,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:53:24,288 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_label44+token_ring.11.cil-2.c[377340,377353] [2025-03-08 06:53:24,318 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_label44+token_ring.11.cil-2.c[383339,383352] [2025-03-08 06:53:24,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:53:24,548 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:53:25,047 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_label44+token_ring.11.cil-2.c[377340,377353] [2025-03-08 06:53:25,055 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_label44+token_ring.11.cil-2.c[383339,383352] [2025-03-08 06:53:25,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:53:25,123 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:53:25,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25 WrapperNode [2025-03-08 06:53:25,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:53:25,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:53:25,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:53:25,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:53:25,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,470 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-03-08 06:53:25,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:53:25,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:53:25,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:53:25,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:53:25,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,607 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:53:25,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:25,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:26,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:53:26,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:53:26,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:53:26,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:53:26,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (1/1) ... [2025-03-08 06:53:26,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:53:26,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:53:26,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:53:26,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:53:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:53:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:53:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:53:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:53:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:53:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:53:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:53:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:53:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:53:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:53:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:53:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:53:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:53:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:53:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:53:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:53:26,179 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:53:26,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:53:31,972 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:53:31,972 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:53:31,972 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:53:31,972 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:53:31,973 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:53:31,974 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:53:31,974 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:53:32,188 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-03-08 06:53:32,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:53:32,238 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:53:32,238 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:53:32,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:32 BoogieIcfgContainer [2025-03-08 06:53:32,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:53:32,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:53:32,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:53:32,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:53:32,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:53:23" (1/3) ... [2025-03-08 06:53:32,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eaa439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:32, skipping insertion in model container [2025-03-08 06:53:32,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:53:25" (2/3) ... [2025-03-08 06:53:32,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eaa439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:53:32, skipping insertion in model container [2025-03-08 06:53:32,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:53:32" (3/3) ... [2025-03-08 06:53:32,247 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.11.cil-2.c [2025-03-08 06:53:32,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:53:32,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.11.cil-2.c that has 7 procedures, 2538 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-08 06:53:32,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:53:32,369 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;@7a7a77ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:53:32,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:53:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 2538 states, 2505 states have (on average 1.8383233532934131) internal successors, (4605), 2507 states have internal predecessors, (4605), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 06:53:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:32,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:32,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:32,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:32,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1442643868, now seen corresponding path program 1 times [2025-03-08 06:53:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832632988] [2025-03-08 06:53:32,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:32,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:32,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:32,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:32,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:32,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832632988] [2025-03-08 06:53:32,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832632988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:32,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654230746] [2025-03-08 06:53:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:32,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:32,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:32,928 INFO L87 Difference]: Start difference. First operand has 2538 states, 2505 states have (on average 1.8383233532934131) internal successors, (4605), 2507 states have internal predecessors, (4605), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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-08 06:53:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:33,615 INFO L93 Difference]: Finished difference Result 5435 states and 9903 transitions. [2025-03-08 06:53:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:53:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:33,638 INFO L225 Difference]: With dead ends: 5435 [2025-03-08 06:53:33,638 INFO L226 Difference]: Without dead ends: 2846 [2025-03-08 06:53:33,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:33,655 INFO L435 NwaCegarLoop]: 4456 mSDtfsCounter, 5089 mSDsluCounter, 9151 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5108 SdHoareTripleChecker+Valid, 13607 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:33,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5108 Valid, 13607 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2025-03-08 06:53:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2819. [2025-03-08 06:53:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2759 states have (on average 1.8024646611090975) internal successors, (4973), 2762 states have internal predecessors, (4973), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:53:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 5064 transitions. [2025-03-08 06:53:33,817 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 5064 transitions. Word has length 165 [2025-03-08 06:53:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:33,817 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 5064 transitions. [2025-03-08 06:53:33,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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-08 06:53:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 5064 transitions. [2025-03-08 06:53:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:33,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:33,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:53:33,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:33,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1867744478, now seen corresponding path program 1 times [2025-03-08 06:53:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:33,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638475814] [2025-03-08 06:53:33,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:33,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:33,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:33,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:33,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638475814] [2025-03-08 06:53:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638475814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230583286] [2025-03-08 06:53:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:34,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:34,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:34,009 INFO L87 Difference]: Start difference. First operand 2819 states and 5064 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:34,426 INFO L93 Difference]: Finished difference Result 3570 states and 6279 transitions. [2025-03-08 06:53:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:34,437 INFO L225 Difference]: With dead ends: 3570 [2025-03-08 06:53:34,438 INFO L226 Difference]: Without dead ends: 2891 [2025-03-08 06:53:34,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:34,440 INFO L435 NwaCegarLoop]: 4375 mSDtfsCounter, 4710 mSDsluCounter, 8605 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4729 SdHoareTripleChecker+Valid, 12980 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:34,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4729 Valid, 12980 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:53:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2025-03-08 06:53:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2819. [2025-03-08 06:53:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2759 states have (on average 1.8017397607828924) internal successors, (4971), 2762 states have internal predecessors, (4971), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:53:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 5062 transitions. [2025-03-08 06:53:34,504 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 5062 transitions. Word has length 165 [2025-03-08 06:53:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:34,504 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 5062 transitions. [2025-03-08 06:53:34,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 5062 transitions. [2025-03-08 06:53:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:34,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:34,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:34,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:53:34,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:34,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash -549953923, now seen corresponding path program 1 times [2025-03-08 06:53:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455724264] [2025-03-08 06:53:34,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:34,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:34,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:34,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:34,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455724264] [2025-03-08 06:53:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455724264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:34,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:34,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87478097] [2025-03-08 06:53:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:34,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:34,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:34,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:34,703 INFO L87 Difference]: Start difference. First operand 2819 states and 5062 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:35,371 INFO L93 Difference]: Finished difference Result 3939 states and 6863 transitions. [2025-03-08 06:53:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:35,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:35,388 INFO L225 Difference]: With dead ends: 3939 [2025-03-08 06:53:35,388 INFO L226 Difference]: Without dead ends: 3260 [2025-03-08 06:53:35,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-08 06:53:35,393 INFO L435 NwaCegarLoop]: 4673 mSDtfsCounter, 5022 mSDsluCounter, 14065 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5041 SdHoareTripleChecker+Valid, 18738 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:35,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5041 Valid, 18738 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2025-03-08 06:53:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3141. [2025-03-08 06:53:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3054 states have (on average 1.778323510150622) internal successors, (5431), 3058 states have internal predecessors, (5431), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-08 06:53:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5565 transitions. [2025-03-08 06:53:35,482 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5565 transitions. Word has length 165 [2025-03-08 06:53:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:35,483 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5565 transitions. [2025-03-08 06:53:35,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5565 transitions. [2025-03-08 06:53:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:35,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:35,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:35,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:53:35,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:35,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash -627944194, now seen corresponding path program 1 times [2025-03-08 06:53:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208518485] [2025-03-08 06:53:35,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:35,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:35,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:35,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:35,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208518485] [2025-03-08 06:53:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208518485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:35,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:35,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001471427] [2025-03-08 06:53:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:35,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:35,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:35,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:35,621 INFO L87 Difference]: Start difference. First operand 3141 states and 5565 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:36,280 INFO L93 Difference]: Finished difference Result 4966 states and 8493 transitions. [2025-03-08 06:53:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:36,298 INFO L225 Difference]: With dead ends: 4966 [2025-03-08 06:53:36,299 INFO L226 Difference]: Without dead ends: 3965 [2025-03-08 06:53:36,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:36,304 INFO L435 NwaCegarLoop]: 4669 mSDtfsCounter, 5017 mSDsluCounter, 14053 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5036 SdHoareTripleChecker+Valid, 18722 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:36,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5036 Valid, 18722 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-03-08 06:53:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3828. [2025-03-08 06:53:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 3685 states have (on average 1.7449118046132972) internal successors, (6430), 3693 states have internal predecessors, (6430), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-08 06:53:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 6656 transitions. [2025-03-08 06:53:36,402 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 6656 transitions. Word has length 165 [2025-03-08 06:53:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:36,402 INFO L471 AbstractCegarLoop]: Abstraction has 3828 states and 6656 transitions. [2025-03-08 06:53:36,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 6656 transitions. [2025-03-08 06:53:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:36,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:36,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:36,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:53:36,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:36,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1724844637, now seen corresponding path program 1 times [2025-03-08 06:53:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:36,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867500485] [2025-03-08 06:53:36,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:36,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:36,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:36,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:36,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:36,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867500485] [2025-03-08 06:53:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867500485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:36,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:36,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594175149] [2025-03-08 06:53:36,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:36,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:36,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:36,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:36,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:36,539 INFO L87 Difference]: Start difference. First operand 3828 states and 6656 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:37,303 INFO L93 Difference]: Finished difference Result 7187 states and 12090 transitions. [2025-03-08 06:53:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:37,323 INFO L225 Difference]: With dead ends: 7187 [2025-03-08 06:53:37,323 INFO L226 Difference]: Without dead ends: 5499 [2025-03-08 06:53:37,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:37,330 INFO L435 NwaCegarLoop]: 4666 mSDtfsCounter, 5012 mSDsluCounter, 14044 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5031 SdHoareTripleChecker+Valid, 18710 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:37,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5031 Valid, 18710 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:53:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2025-03-08 06:53:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 5325. [2025-03-08 06:53:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5325 states, 5064 states have (on average 1.7089257503949447) internal successors, (8654), 5086 states have internal predecessors, (8654), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-08 06:53:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 9088 transitions. [2025-03-08 06:53:37,495 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 9088 transitions. Word has length 165 [2025-03-08 06:53:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:37,495 INFO L471 AbstractCegarLoop]: Abstraction has 5325 states and 9088 transitions. [2025-03-08 06:53:37,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 9088 transitions. [2025-03-08 06:53:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:37,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:37,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:37,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:53:37,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 830909726, now seen corresponding path program 1 times [2025-03-08 06:53:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514719722] [2025-03-08 06:53:37,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:37,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:37,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:37,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:37,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:37,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514719722] [2025-03-08 06:53:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514719722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:37,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:37,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247553212] [2025-03-08 06:53:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:37,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:37,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:37,638 INFO L87 Difference]: Start difference. First operand 5325 states and 9088 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:38,365 INFO L93 Difference]: Finished difference Result 12102 states and 20272 transitions. [2025-03-08 06:53:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:38,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:38,406 INFO L225 Difference]: With dead ends: 12102 [2025-03-08 06:53:38,406 INFO L226 Difference]: Without dead ends: 8917 [2025-03-08 06:53:38,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:38,419 INFO L435 NwaCegarLoop]: 4663 mSDtfsCounter, 5007 mSDsluCounter, 14035 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5026 SdHoareTripleChecker+Valid, 18698 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:38,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5026 Valid, 18698 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:53:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8917 states. [2025-03-08 06:53:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8917 to 8670. [2025-03-08 06:53:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8670 states, 8155 states have (on average 1.6855916615573268) internal successors, (13746), 8223 states have internal predecessors, (13746), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:53:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14692 transitions. [2025-03-08 06:53:38,641 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14692 transitions. Word has length 165 [2025-03-08 06:53:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:38,641 INFO L471 AbstractCegarLoop]: Abstraction has 8670 states and 14692 transitions. [2025-03-08 06:53:38,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14692 transitions. [2025-03-08 06:53:38,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:38,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:38,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:38,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:53:38,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:38,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1910451773, now seen corresponding path program 1 times [2025-03-08 06:53:38,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:38,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583941213] [2025-03-08 06:53:38,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:38,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:38,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:38,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:38,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:38,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583941213] [2025-03-08 06:53:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583941213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269389938] [2025-03-08 06:53:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:38,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:38,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:38,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:38,747 INFO L87 Difference]: Start difference. First operand 8670 states and 14692 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:39,209 INFO L93 Difference]: Finished difference Result 16694 states and 28424 transitions. [2025-03-08 06:53:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:39,240 INFO L225 Difference]: With dead ends: 16694 [2025-03-08 06:53:39,240 INFO L226 Difference]: Without dead ends: 10164 [2025-03-08 06:53:39,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:39,261 INFO L435 NwaCegarLoop]: 4362 mSDtfsCounter, 4702 mSDsluCounter, 8580 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4721 SdHoareTripleChecker+Valid, 12942 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:39,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4721 Valid, 12942 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10164 states. [2025-03-08 06:53:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10164 to 8670. [2025-03-08 06:53:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8670 states, 8155 states have (on average 1.683507050889025) internal successors, (13729), 8223 states have internal predecessors, (13729), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:53:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14675 transitions. [2025-03-08 06:53:39,489 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14675 transitions. Word has length 165 [2025-03-08 06:53:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:39,489 INFO L471 AbstractCegarLoop]: Abstraction has 8670 states and 14675 transitions. [2025-03-08 06:53:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14675 transitions. [2025-03-08 06:53:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:39,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:39,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:53:39,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash -28087524, now seen corresponding path program 1 times [2025-03-08 06:53:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231745389] [2025-03-08 06:53:39,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:39,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:39,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:39,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:39,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:39,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:39,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231745389] [2025-03-08 06:53:39,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231745389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:39,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:39,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458223202] [2025-03-08 06:53:39,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:39,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:39,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:39,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:39,585 INFO L87 Difference]: Start difference. First operand 8670 states and 14675 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:39,983 INFO L93 Difference]: Finished difference Result 16611 states and 28224 transitions. [2025-03-08 06:53:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:39,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:40,014 INFO L225 Difference]: With dead ends: 16611 [2025-03-08 06:53:40,014 INFO L226 Difference]: Without dead ends: 10081 [2025-03-08 06:53:40,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:40,034 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4699 mSDsluCounter, 8575 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4718 SdHoareTripleChecker+Valid, 12934 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:40,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4718 Valid, 12934 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10081 states. [2025-03-08 06:53:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10081 to 8670. [2025-03-08 06:53:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8670 states, 8155 states have (on average 1.6814224402207234) internal successors, (13712), 8223 states have internal predecessors, (13712), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:53:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8670 states to 8670 states and 14658 transitions. [2025-03-08 06:53:40,343 INFO L78 Accepts]: Start accepts. Automaton has 8670 states and 14658 transitions. Word has length 165 [2025-03-08 06:53:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:40,344 INFO L471 AbstractCegarLoop]: Abstraction has 8670 states and 14658 transitions. [2025-03-08 06:53:40,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8670 states and 14658 transitions. [2025-03-08 06:53:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:40,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:40,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:40,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:53:40,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:40,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1476094371, now seen corresponding path program 1 times [2025-03-08 06:53:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:40,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415579187] [2025-03-08 06:53:40,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:40,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:40,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:40,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:40,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:40,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:40,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415579187] [2025-03-08 06:53:40,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415579187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:40,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:40,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:40,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651445559] [2025-03-08 06:53:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:40,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:40,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:40,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:40,461 INFO L87 Difference]: Start difference. First operand 8670 states and 14658 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:41,272 INFO L93 Difference]: Finished difference Result 22977 states and 38876 transitions. [2025-03-08 06:53:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:41,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:41,325 INFO L225 Difference]: With dead ends: 22977 [2025-03-08 06:53:41,326 INFO L226 Difference]: Without dead ends: 16447 [2025-03-08 06:53:41,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:41,350 INFO L435 NwaCegarLoop]: 4646 mSDtfsCounter, 4983 mSDsluCounter, 13988 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5002 SdHoareTripleChecker+Valid, 18634 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:41,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5002 Valid, 18634 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:53:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16447 states. [2025-03-08 06:53:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16447 to 16116. [2025-03-08 06:53:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16116 states, 15039 states have (on average 1.6760422900458807) internal successors, (25206), 15253 states have internal predecessors, (25206), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:53:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16116 states to 16116 states and 27560 transitions. [2025-03-08 06:53:41,850 INFO L78 Accepts]: Start accepts. Automaton has 16116 states and 27560 transitions. Word has length 165 [2025-03-08 06:53:41,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:41,850 INFO L471 AbstractCegarLoop]: Abstraction has 16116 states and 27560 transitions. [2025-03-08 06:53:41,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 16116 states and 27560 transitions. [2025-03-08 06:53:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:41,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:41,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:41,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:53:41,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash -137330948, now seen corresponding path program 1 times [2025-03-08 06:53:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281008572] [2025-03-08 06:53:41,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:41,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:41,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:41,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:41,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:41,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:41,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281008572] [2025-03-08 06:53:41,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281008572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:41,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:41,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035064803] [2025-03-08 06:53:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:41,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:41,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:41,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:41,944 INFO L87 Difference]: Start difference. First operand 16116 states and 27560 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:42,597 INFO L93 Difference]: Finished difference Result 33767 states and 58836 transitions. [2025-03-08 06:53:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:42,655 INFO L225 Difference]: With dead ends: 33767 [2025-03-08 06:53:42,656 INFO L226 Difference]: Without dead ends: 19791 [2025-03-08 06:53:42,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:42,686 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4695 mSDsluCounter, 8566 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4714 SdHoareTripleChecker+Valid, 12920 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:42,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4714 Valid, 12920 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19791 states. [2025-03-08 06:53:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19791 to 16116. [2025-03-08 06:53:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16116 states, 15039 states have (on average 1.6738479952124476) internal successors, (25173), 15253 states have internal predecessors, (25173), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:53:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16116 states to 16116 states and 27527 transitions. [2025-03-08 06:53:43,375 INFO L78 Accepts]: Start accepts. Automaton has 16116 states and 27527 transitions. Word has length 165 [2025-03-08 06:53:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:43,375 INFO L471 AbstractCegarLoop]: Abstraction has 16116 states and 27527 transitions. [2025-03-08 06:53:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 16116 states and 27527 transitions. [2025-03-08 06:53:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:43,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:43,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:43,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:53:43,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:43,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash 44402301, now seen corresponding path program 1 times [2025-03-08 06:53:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912448450] [2025-03-08 06:53:43,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:43,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:43,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:43,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:43,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912448450] [2025-03-08 06:53:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912448450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:43,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121187033] [2025-03-08 06:53:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:43,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:43,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:43,493 INFO L87 Difference]: Start difference. First operand 16116 states and 27527 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:44,168 INFO L93 Difference]: Finished difference Result 33522 states and 58280 transitions. [2025-03-08 06:53:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:44,226 INFO L225 Difference]: With dead ends: 33522 [2025-03-08 06:53:44,226 INFO L226 Difference]: Without dead ends: 19546 [2025-03-08 06:53:44,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:44,247 INFO L435 NwaCegarLoop]: 4351 mSDtfsCounter, 4692 mSDsluCounter, 8561 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4711 SdHoareTripleChecker+Valid, 12912 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:44,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4711 Valid, 12912 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19546 states. [2025-03-08 06:53:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19546 to 16116. [2025-03-08 06:53:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16116 states, 15039 states have (on average 1.6716537003790146) internal successors, (25140), 15253 states have internal predecessors, (25140), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:53:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16116 states to 16116 states and 27494 transitions. [2025-03-08 06:53:44,654 INFO L78 Accepts]: Start accepts. Automaton has 16116 states and 27494 transitions. Word has length 165 [2025-03-08 06:53:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:44,654 INFO L471 AbstractCegarLoop]: Abstraction has 16116 states and 27494 transitions. [2025-03-08 06:53:44,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16116 states and 27494 transitions. [2025-03-08 06:53:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:44,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:44,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:44,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:53:44,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:44,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash 188811996, now seen corresponding path program 1 times [2025-03-08 06:53:44,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:44,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207188825] [2025-03-08 06:53:44,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:44,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:44,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:44,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:44,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:44,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207188825] [2025-03-08 06:53:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207188825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029336035] [2025-03-08 06:53:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:44,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:44,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:44,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:44,757 INFO L87 Difference]: Start difference. First operand 16116 states and 27494 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:45,956 INFO L93 Difference]: Finished difference Result 49953 states and 86479 transitions. [2025-03-08 06:53:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:45,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:46,057 INFO L225 Difference]: With dead ends: 49953 [2025-03-08 06:53:46,058 INFO L226 Difference]: Without dead ends: 35977 [2025-03-08 06:53:46,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:46,097 INFO L435 NwaCegarLoop]: 4631 mSDtfsCounter, 5306 mSDsluCounter, 13940 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5337 SdHoareTripleChecker+Valid, 18571 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:46,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5337 Valid, 18571 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:53:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35977 states. [2025-03-08 06:53:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35977 to 32775. [2025-03-08 06:53:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.6825647089738536) internal successors, (51224), 31112 states have internal predecessors, (51224), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:53:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57866 transitions. [2025-03-08 06:53:47,145 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57866 transitions. Word has length 165 [2025-03-08 06:53:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:47,145 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57866 transitions. [2025-03-08 06:53:47,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57866 transitions. [2025-03-08 06:53:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:47,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:47,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:53:47,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash -83624291, now seen corresponding path program 1 times [2025-03-08 06:53:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369728831] [2025-03-08 06:53:47,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:47,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:47,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:47,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:47,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369728831] [2025-03-08 06:53:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369728831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:47,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:47,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076871342] [2025-03-08 06:53:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:47,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:47,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:47,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:47,216 INFO L87 Difference]: Start difference. First operand 32775 states and 57866 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:48,891 INFO L93 Difference]: Finished difference Result 72182 states and 131320 transitions. [2025-03-08 06:53:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:49,033 INFO L225 Difference]: With dead ends: 72182 [2025-03-08 06:53:49,034 INFO L226 Difference]: Without dead ends: 41547 [2025-03-08 06:53:49,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:49,128 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4686 mSDsluCounter, 8550 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4705 SdHoareTripleChecker+Valid, 12896 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:49,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4705 Valid, 12896 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41547 states. [2025-03-08 06:53:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41547 to 32775. [2025-03-08 06:53:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.6804296413086321) internal successors, (51159), 31112 states have internal predecessors, (51159), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:53:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57801 transitions. [2025-03-08 06:53:50,683 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57801 transitions. Word has length 165 [2025-03-08 06:53:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57801 transitions. [2025-03-08 06:53:50,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57801 transitions. [2025-03-08 06:53:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:50,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:50,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:50,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:53:50,692 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1893527876, now seen corresponding path program 1 times [2025-03-08 06:53:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527693182] [2025-03-08 06:53:50,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:50,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:50,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:50,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:50,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527693182] [2025-03-08 06:53:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527693182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:50,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:50,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830067672] [2025-03-08 06:53:50,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:50,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:50,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:50,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:50,765 INFO L87 Difference]: Start difference. First operand 32775 states and 57801 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:51,917 INFO L93 Difference]: Finished difference Result 70720 states and 128266 transitions. [2025-03-08 06:53:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:52,028 INFO L225 Difference]: With dead ends: 70720 [2025-03-08 06:53:52,028 INFO L226 Difference]: Without dead ends: 40085 [2025-03-08 06:53:52,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:52,097 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4682 mSDsluCounter, 8541 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4701 SdHoareTripleChecker+Valid, 12882 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:52,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4701 Valid, 12882 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:53:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40085 states. [2025-03-08 06:53:53,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40085 to 32775. [2025-03-08 06:53:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.678294573643411) internal successors, (51094), 31112 states have internal predecessors, (51094), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:53:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57736 transitions. [2025-03-08 06:53:53,590 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57736 transitions. Word has length 165 [2025-03-08 06:53:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:53,590 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57736 transitions. [2025-03-08 06:53:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57736 transitions. [2025-03-08 06:53:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:53,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:53,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:53:53,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2109053595, now seen corresponding path program 1 times [2025-03-08 06:53:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695233325] [2025-03-08 06:53:53,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:53,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:53,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:53,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:53,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695233325] [2025-03-08 06:53:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695233325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:53:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967860124] [2025-03-08 06:53:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:53,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:53:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:53,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:53:53,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:53:53,772 INFO L87 Difference]: Start difference. First operand 32775 states and 57736 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:55,402 INFO L93 Difference]: Finished difference Result 69989 states and 126674 transitions. [2025-03-08 06:53:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:53:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:55,525 INFO L225 Difference]: With dead ends: 69989 [2025-03-08 06:53:55,526 INFO L226 Difference]: Without dead ends: 39354 [2025-03-08 06:53:55,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:55,589 INFO L435 NwaCegarLoop]: 4338 mSDtfsCounter, 4679 mSDsluCounter, 8536 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 12874 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:55,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 12874 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:53:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39354 states. [2025-03-08 06:53:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39354 to 32775. [2025-03-08 06:53:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32775 states, 30444 states have (on average 1.6761595059781895) internal successors, (51029), 31112 states have internal predecessors, (51029), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:53:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32775 states to 32775 states and 57671 transitions. [2025-03-08 06:53:56,821 INFO L78 Accepts]: Start accepts. Automaton has 32775 states and 57671 transitions. Word has length 165 [2025-03-08 06:53:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:53:56,821 INFO L471 AbstractCegarLoop]: Abstraction has 32775 states and 57671 transitions. [2025-03-08 06:53:56,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 32775 states and 57671 transitions. [2025-03-08 06:53:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:53:56,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:53:56,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:53:56,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:53:56,830 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:53:56,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:53:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -255682852, now seen corresponding path program 1 times [2025-03-08 06:53:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:53:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342333475] [2025-03-08 06:53:56,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:53:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:53:56,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:53:56,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:53:56,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:53:56,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:53:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:53:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:53:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342333475] [2025-03-08 06:53:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342333475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:53:56,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:53:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:53:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355539533] [2025-03-08 06:53:56,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:53:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:53:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:53:56,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:53:56,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:53:56,913 INFO L87 Difference]: Start difference. First operand 32775 states and 57671 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:53:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:53:59,558 INFO L93 Difference]: Finished difference Result 103068 states and 187972 transitions. [2025-03-08 06:53:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:53:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:53:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:53:59,774 INFO L225 Difference]: With dead ends: 103068 [2025-03-08 06:53:59,775 INFO L226 Difference]: Without dead ends: 72433 [2025-03-08 06:53:59,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:53:59,847 INFO L435 NwaCegarLoop]: 4609 mSDtfsCounter, 5124 mSDsluCounter, 13879 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5155 SdHoareTripleChecker+Valid, 18488 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:53:59,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5155 Valid, 18488 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:53:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72433 states. [2025-03-08 06:54:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72433 to 68670. [2025-03-08 06:54:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68670 states, 63377 states have (on average 1.6851065844075928) internal successors, (106797), 65439 states have internal predecessors, (106797), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-08 06:54:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68670 states to 68670 states and 128095 transitions. [2025-03-08 06:54:02,589 INFO L78 Accepts]: Start accepts. Automaton has 68670 states and 128095 transitions. Word has length 165 [2025-03-08 06:54:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 68670 states and 128095 transitions. [2025-03-08 06:54:02,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:54:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 68670 states and 128095 transitions. [2025-03-08 06:54:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:54:02,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:02,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:02,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:54:02,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:02,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash -470512005, now seen corresponding path program 1 times [2025-03-08 06:54:02,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:02,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972299787] [2025-03-08 06:54:02,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:02,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:02,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:54:02,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:54:02,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:02,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972299787] [2025-03-08 06:54:02,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972299787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:02,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:54:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627157011] [2025-03-08 06:54:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:02,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:54:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:02,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:54:02,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:54:02,673 INFO L87 Difference]: Start difference. First operand 68670 states and 128095 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:54:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:06,553 INFO L93 Difference]: Finished difference Result 150523 states and 292922 transitions. [2025-03-08 06:54:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:54:06,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:54:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:06,861 INFO L225 Difference]: With dead ends: 150523 [2025-03-08 06:54:06,861 INFO L226 Difference]: Without dead ends: 83993 [2025-03-08 06:54:07,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:07,029 INFO L435 NwaCegarLoop]: 4333 mSDtfsCounter, 4675 mSDsluCounter, 8527 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4694 SdHoareTripleChecker+Valid, 12860 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:07,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4694 Valid, 12860 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:54:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83993 states. [2025-03-08 06:54:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83993 to 68670. [2025-03-08 06:54:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68670 states, 63377 states have (on average 1.6830711456837655) internal successors, (106668), 65439 states have internal predecessors, (106668), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-08 06:54:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68670 states to 68670 states and 127966 transitions. [2025-03-08 06:54:11,861 INFO L78 Accepts]: Start accepts. Automaton has 68670 states and 127966 transitions. Word has length 165 [2025-03-08 06:54:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 68670 states and 127966 transitions. [2025-03-08 06:54:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:54:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 68670 states and 127966 transitions. [2025-03-08 06:54:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:54:11,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:11,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:11,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:54:11,875 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:11,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1323673340, now seen corresponding path program 1 times [2025-03-08 06:54:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319986473] [2025-03-08 06:54:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:11,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:54:11,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:54:11,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:11,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319986473] [2025-03-08 06:54:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319986473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:11,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:11,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494655409] [2025-03-08 06:54:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:11,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:11,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:11,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:11,950 INFO L87 Difference]: Start difference. First operand 68670 states and 127966 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:54:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:54:18,036 INFO L93 Difference]: Finished difference Result 219509 states and 436283 transitions. [2025-03-08 06:54:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:54:18,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 06:54:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:54:18,679 INFO L225 Difference]: With dead ends: 219509 [2025-03-08 06:54:18,679 INFO L226 Difference]: Without dead ends: 152979 [2025-03-08 06:54:18,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:54:18,889 INFO L435 NwaCegarLoop]: 4601 mSDtfsCounter, 5051 mSDsluCounter, 13856 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 18457 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:54:18,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 18457 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:54:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152979 states. [2025-03-08 06:54:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152979 to 147558. [2025-03-08 06:54:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147558 states, 134947 states have (on average 1.6902191230631285) internal successors, (228090), 141255 states have internal predecessors, (228090), 4761 states have call successors, (4761), 1542 states have call predecessors, (4761), 7848 states have return successors, (70297), 5016 states have call predecessors, (70297), 4761 states have call successors, (70297) [2025-03-08 06:54:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147558 states to 147558 states and 303148 transitions. [2025-03-08 06:54:28,919 INFO L78 Accepts]: Start accepts. Automaton has 147558 states and 303148 transitions. Word has length 165 [2025-03-08 06:54:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:54:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 147558 states and 303148 transitions. [2025-03-08 06:54:28,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 06:54:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 147558 states and 303148 transitions. [2025-03-08 06:54:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 06:54:28,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:54:28,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:54:28,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:54:28,957 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:54:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:54:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1797192283, now seen corresponding path program 1 times [2025-03-08 06:54:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:54:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925304066] [2025-03-08 06:54:28,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:54:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:54:28,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 06:54:28,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 06:54:28,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:54:28,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:54:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:54:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:54:29,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925304066] [2025-03-08 06:54:29,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925304066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:54:29,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:54:29,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:54:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937425042] [2025-03-08 06:54:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:54:29,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:54:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:54:29,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:54:29,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:54:29,094 INFO L87 Difference]: Start difference. First operand 147558 states and 303148 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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)