./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02a5384e72a6893ea777db3cb5d438cb5a46ff3cad82e91f14686b217f61c414 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:08:25,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:08:25,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:08:25,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:08:25,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:08:25,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:08:25,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:08:25,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:08:25,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:08:25,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:08:25,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:08:25,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:08:25,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:08:25,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:08:25,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:08:25,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:08:25,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:08:25,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:08:25,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:08:25,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:08:25,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:08:25,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:08:25,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:08:25,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:08:25,711 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 -> 02a5384e72a6893ea777db3cb5d438cb5a46ff3cad82e91f14686b217f61c414 [2025-03-16 20:08:25,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:08:25,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:08:25,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:08:25,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:08:25,970 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:08:25,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.cil-2.c [2025-03-16 20:08:27,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9c47cd0/90db42fe2eec448fba621f0d4cfa068a/FLAGc7c1e4c6b [2025-03-16 20:08:27,685 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:08:27,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.cil-2.c [2025-03-16 20:08:27,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9c47cd0/90db42fe2eec448fba621f0d4cfa068a/FLAGc7c1e4c6b [2025-03-16 20:08:27,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9c47cd0/90db42fe2eec448fba621f0d4cfa068a [2025-03-16 20:08:27,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:08:27,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:08:27,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:08:27,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:08:27,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:08:27,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:08:27" (1/1) ... [2025-03-16 20:08:27,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697dc5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:27, skipping insertion in model container [2025-03-16 20:08:27,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:08:27" (1/1) ... [2025-03-16 20:08:27,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:08:29,012 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_label49+token_ring.12.cil-2.c[380593,380606] [2025-03-16 20:08:29,040 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_label49+token_ring.12.cil-2.c[383339,383352] [2025-03-16 20:08:29,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:08:29,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:08:29,781 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_label49+token_ring.12.cil-2.c[380593,380606] [2025-03-16 20:08:29,785 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_label49+token_ring.12.cil-2.c[383339,383352] [2025-03-16 20:08:29,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:08:29,855 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:08:29,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29 WrapperNode [2025-03-16 20:08:29,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:08:29,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:08:29,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:08:29,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:08:29,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:29,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,334 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13185 [2025-03-16 20:08:30,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:08:30,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:08:30,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:08:30,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:08:30,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,464 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:08:30,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:08:30,754 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:08:30,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:08:30,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:08:30,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (1/1) ... [2025-03-16 20:08:30,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:08:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:08:30,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:08:30,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:08:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:08:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:08:30,801 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:08:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:08:30,801 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:08:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:08:30,802 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:08:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:08:30,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:08:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:08:30,802 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:08:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:08:30,802 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:08:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:08:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:08:30,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:08:30,923 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:08:30,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:08:37,076 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:08:37,077 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:08:37,077 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:08:37,077 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:08:37,078 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:08:37,078 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:08:37,078 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:08:37,304 INFO L? ?]: Removed 1740 outVars from TransFormulas that were not future-live. [2025-03-16 20:08:37,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:08:37,368 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:08:37,368 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:08:37,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:37 BoogieIcfgContainer [2025-03-16 20:08:37,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:08:37,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:08:37,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:08:37,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:08:37,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:08:27" (1/3) ... [2025-03-16 20:08:37,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3d443a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:37, skipping insertion in model container [2025-03-16 20:08:37,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:29" (2/3) ... [2025-03-16 20:08:37,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3d443a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:37, skipping insertion in model container [2025-03-16 20:08:37,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:37" (3/3) ... [2025-03-16 20:08:37,381 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.12.cil-2.c [2025-03-16 20:08:37,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:08:37,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.12.cil-2.c that has 7 procedures, 2484 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-16 20:08:37,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:08:37,586 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;@41be4a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:08:37,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:08:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 2484 states, 2450 states have (on average 1.863673469387755) internal successors, (4566), 2452 states have internal predecessors, (4566), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 20:08:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:37,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:37,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:37,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:37,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -957423537, now seen corresponding path program 1 times [2025-03-16 20:08:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:37,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711107058] [2025-03-16 20:08:37,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:37,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:37,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:37,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:37,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:38,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711107058] [2025-03-16 20:08:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711107058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:38,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:08:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774844623] [2025-03-16 20:08:38,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:38,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:08:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:38,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:08:38,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:38,140 INFO L87 Difference]: Start difference. First operand has 2484 states, 2450 states have (on average 1.863673469387755) internal successors, (4566), 2452 states have internal predecessors, (4566), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:38,305 INFO L93 Difference]: Finished difference Result 4960 states and 9218 transitions. [2025-03-16 20:08:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:08:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2025-03-16 20:08:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:38,330 INFO L225 Difference]: With dead ends: 4960 [2025-03-16 20:08:38,331 INFO L226 Difference]: Without dead ends: 2479 [2025-03-16 20:08:38,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:38,339 INFO L435 NwaCegarLoop]: 4540 mSDtfsCounter, 570 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 8501 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:38,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 8501 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:08:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-03-16 20:08:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2479. [2025-03-16 20:08:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2445 states have (on average 1.832719836400818) internal successors, (4481), 2447 states have internal predecessors, (4481), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 20:08:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 4533 transitions. [2025-03-16 20:08:38,453 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 4533 transitions. Word has length 161 [2025-03-16 20:08:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:38,455 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 4533 transitions. [2025-03-16 20:08:38,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 4533 transitions. [2025-03-16 20:08:38,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:38,460 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] [2025-03-16 20:08:38,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:08:38,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:38,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1150354738, now seen corresponding path program 1 times [2025-03-16 20:08:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56648574] [2025-03-16 20:08:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:38,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:38,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:38,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:38,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:38,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56648574] [2025-03-16 20:08:38,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56648574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:38,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:38,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490784617] [2025-03-16 20:08:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:38,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:38,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:38,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:38,782 INFO L87 Difference]: Start difference. First operand 2479 states and 4533 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:39,421 INFO L93 Difference]: Finished difference Result 3208 states and 5718 transitions. [2025-03-16 20:08:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:08:39,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:39,435 INFO L225 Difference]: With dead ends: 3208 [2025-03-16 20:08:39,436 INFO L226 Difference]: Without dead ends: 2868 [2025-03-16 20:08:39,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-16 20:08:39,440 INFO L435 NwaCegarLoop]: 4412 mSDtfsCounter, 5066 mSDsluCounter, 9076 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5086 SdHoareTripleChecker+Valid, 13488 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:39,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5086 Valid, 13488 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2025-03-16 20:08:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2839. [2025-03-16 20:08:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2777 states have (on average 1.8080662585523948) internal successors, (5021), 2780 states have internal predecessors, (5021), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-16 20:08:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 5116 transitions. [2025-03-16 20:08:39,509 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 5116 transitions. Word has length 161 [2025-03-16 20:08:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:39,509 INFO L471 AbstractCegarLoop]: Abstraction has 2839 states and 5116 transitions. [2025-03-16 20:08:39,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 5116 transitions. [2025-03-16 20:08:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:39,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:39,512 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] [2025-03-16 20:08:39,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:08:39,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:39,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 753737454, now seen corresponding path program 1 times [2025-03-16 20:08:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861540040] [2025-03-16 20:08:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:39,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:39,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:39,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861540040] [2025-03-16 20:08:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861540040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:39,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:39,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939555766] [2025-03-16 20:08:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:39,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:39,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:39,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:39,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:39,684 INFO L87 Difference]: Start difference. First operand 2839 states and 5116 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:40,077 INFO L93 Difference]: Finished difference Result 3617 states and 6396 transitions. [2025-03-16 20:08:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:40,088 INFO L225 Difference]: With dead ends: 3617 [2025-03-16 20:08:40,088 INFO L226 Difference]: Without dead ends: 2917 [2025-03-16 20:08:40,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:40,091 INFO L435 NwaCegarLoop]: 4402 mSDtfsCounter, 4740 mSDsluCounter, 8649 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4760 SdHoareTripleChecker+Valid, 13051 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:40,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4760 Valid, 13051 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2025-03-16 20:08:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2839. [2025-03-16 20:08:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2777 states have (on average 1.8073460568959308) internal successors, (5019), 2780 states have internal predecessors, (5019), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-16 20:08:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 5114 transitions. [2025-03-16 20:08:40,151 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 5114 transitions. Word has length 161 [2025-03-16 20:08:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:40,151 INFO L471 AbstractCegarLoop]: Abstraction has 2839 states and 5114 transitions. [2025-03-16 20:08:40,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 5114 transitions. [2025-03-16 20:08:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:40,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:40,153 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] [2025-03-16 20:08:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:08:40,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:40,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash -140197457, now seen corresponding path program 1 times [2025-03-16 20:08:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:40,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081553750] [2025-03-16 20:08:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:40,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:40,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:40,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:40,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:40,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:40,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081553750] [2025-03-16 20:08:40,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081553750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:40,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:40,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416809898] [2025-03-16 20:08:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:40,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:40,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:40,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:40,341 INFO L87 Difference]: Start difference. First operand 2839 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:41,055 INFO L93 Difference]: Finished difference Result 4000 states and 7013 transitions. [2025-03-16 20:08:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:41,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:41,070 INFO L225 Difference]: With dead ends: 4000 [2025-03-16 20:08:41,070 INFO L226 Difference]: Without dead ends: 3300 [2025-03-16 20:08:41,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:41,074 INFO L435 NwaCegarLoop]: 4722 mSDtfsCounter, 5068 mSDsluCounter, 14219 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5088 SdHoareTripleChecker+Valid, 18941 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:41,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5088 Valid, 18941 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2025-03-16 20:08:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3171. [2025-03-16 20:08:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 3081 states have (on average 1.7857838364167478) internal successors, (5502), 3085 states have internal predecessors, (5502), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-16 20:08:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 5642 transitions. [2025-03-16 20:08:41,161 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 5642 transitions. Word has length 161 [2025-03-16 20:08:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:41,161 INFO L471 AbstractCegarLoop]: Abstraction has 3171 states and 5642 transitions. [2025-03-16 20:08:41,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 5642 transitions. [2025-03-16 20:08:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:41,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:41,163 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] [2025-03-16 20:08:41,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:08:41,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:41,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 939344590, now seen corresponding path program 1 times [2025-03-16 20:08:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:41,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799761418] [2025-03-16 20:08:41,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:41,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:41,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:41,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:41,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799761418] [2025-03-16 20:08:41,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799761418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:41,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511140532] [2025-03-16 20:08:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:41,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:41,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:41,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:41,391 INFO L87 Difference]: Start difference. First operand 3171 states and 5642 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:42,141 INFO L93 Difference]: Finished difference Result 5063 states and 8730 transitions. [2025-03-16 20:08:42,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:42,160 INFO L225 Difference]: With dead ends: 5063 [2025-03-16 20:08:42,160 INFO L226 Difference]: Without dead ends: 4031 [2025-03-16 20:08:42,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:42,167 INFO L435 NwaCegarLoop]: 4718 mSDtfsCounter, 5063 mSDsluCounter, 14207 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5083 SdHoareTripleChecker+Valid, 18925 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:42,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5083 Valid, 18925 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2025-03-16 20:08:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 3882. [2025-03-16 20:08:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3882 states, 3734 states have (on average 1.7554900910551687) internal successors, (6555), 3742 states have internal predecessors, (6555), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-16 20:08:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 6791 transitions. [2025-03-16 20:08:42,287 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 6791 transitions. Word has length 161 [2025-03-16 20:08:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:42,288 INFO L471 AbstractCegarLoop]: Abstraction has 3882 states and 6791 transitions. [2025-03-16 20:08:42,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 6791 transitions. [2025-03-16 20:08:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:42,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:42,291 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] [2025-03-16 20:08:42,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:08:42,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:42,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:42,293 INFO L85 PathProgramCache]: Analyzing trace with hash 974168527, now seen corresponding path program 1 times [2025-03-16 20:08:42,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:42,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339822930] [2025-03-16 20:08:42,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:42,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:42,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:42,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:42,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:42,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:42,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:42,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339822930] [2025-03-16 20:08:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339822930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:42,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879597431] [2025-03-16 20:08:42,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:42,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:42,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:42,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:42,448 INFO L87 Difference]: Start difference. First operand 3882 states and 6791 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:43,206 INFO L93 Difference]: Finished difference Result 7372 states and 12533 transitions. [2025-03-16 20:08:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:43,225 INFO L225 Difference]: With dead ends: 7372 [2025-03-16 20:08:43,226 INFO L226 Difference]: Without dead ends: 5629 [2025-03-16 20:08:43,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:43,231 INFO L435 NwaCegarLoop]: 4715 mSDtfsCounter, 5058 mSDsluCounter, 14198 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5078 SdHoareTripleChecker+Valid, 18913 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:43,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5078 Valid, 18913 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5629 states. [2025-03-16 20:08:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5629 to 5439. [2025-03-16 20:08:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5169 states have (on average 1.7239311278777327) internal successors, (8911), 5191 states have internal predecessors, (8911), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-16 20:08:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 9363 transitions. [2025-03-16 20:08:43,367 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 9363 transitions. Word has length 161 [2025-03-16 20:08:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:43,368 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 9363 transitions. [2025-03-16 20:08:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 9363 transitions. [2025-03-16 20:08:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:43,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:43,371 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] [2025-03-16 20:08:43,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:08:43,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:43,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash -964370770, now seen corresponding path program 1 times [2025-03-16 20:08:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:43,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011479982] [2025-03-16 20:08:43,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:43,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:43,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:43,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:43,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011479982] [2025-03-16 20:08:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011479982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:43,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584600460] [2025-03-16 20:08:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:43,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:43,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:43,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:43,502 INFO L87 Difference]: Start difference. First operand 5439 states and 9363 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:44,181 INFO L93 Difference]: Finished difference Result 12511 states and 21223 transitions. [2025-03-16 20:08:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:44,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:44,275 INFO L225 Difference]: With dead ends: 12511 [2025-03-16 20:08:44,276 INFO L226 Difference]: Without dead ends: 9211 [2025-03-16 20:08:44,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:44,283 INFO L435 NwaCegarLoop]: 4447 mSDtfsCounter, 5089 mSDsluCounter, 13557 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5109 SdHoareTripleChecker+Valid, 18004 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:44,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5109 Valid, 18004 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2025-03-16 20:08:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 8940. [2025-03-16 20:08:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8940 states, 8408 states have (on average 1.7053996194100856) internal successors, (14339), 8476 states have internal predecessors, (14339), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-16 20:08:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8940 states to 8940 states and 15319 transitions. [2025-03-16 20:08:44,509 INFO L78 Accepts]: Start accepts. Automaton has 8940 states and 15319 transitions. Word has length 161 [2025-03-16 20:08:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:44,509 INFO L471 AbstractCegarLoop]: Abstraction has 8940 states and 15319 transitions. [2025-03-16 20:08:44,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 8940 states and 15319 transitions. [2025-03-16 20:08:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:44,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:44,514 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] [2025-03-16 20:08:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:08:44,515 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1882589679, now seen corresponding path program 1 times [2025-03-16 20:08:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021909273] [2025-03-16 20:08:44,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:44,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:44,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:44,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:44,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021909273] [2025-03-16 20:08:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021909273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:44,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:44,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:44,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306980473] [2025-03-16 20:08:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:44,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:44,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:44,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:44,655 INFO L87 Difference]: Start difference. First operand 8940 states and 15319 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:45,690 INFO L93 Difference]: Finished difference Result 24278 states and 41833 transitions. [2025-03-16 20:08:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:45,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:45,752 INFO L225 Difference]: With dead ends: 24278 [2025-03-16 20:08:45,752 INFO L226 Difference]: Without dead ends: 17477 [2025-03-16 20:08:45,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:45,776 INFO L435 NwaCegarLoop]: 4709 mSDtfsCounter, 5048 mSDsluCounter, 14180 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5068 SdHoareTripleChecker+Valid, 18889 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:45,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5068 Valid, 18889 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:08:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17477 states. [2025-03-16 20:08:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17477 to 17049. [2025-03-16 20:08:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17049 states, 15939 states have (on average 1.7089528828659264) internal successors, (27239), 16153 states have internal predecessors, (27239), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:08:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17049 states to 17049 states and 29659 transitions. [2025-03-16 20:08:46,260 INFO L78 Accepts]: Start accepts. Automaton has 17049 states and 29659 transitions. Word has length 161 [2025-03-16 20:08:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:46,261 INFO L471 AbstractCegarLoop]: Abstraction has 17049 states and 29659 transitions. [2025-03-16 20:08:46,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 17049 states and 29659 transitions. [2025-03-16 20:08:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:46,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:46,268 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] [2025-03-16 20:08:46,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:08:46,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:46,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1073614194, now seen corresponding path program 1 times [2025-03-16 20:08:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:46,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458527290] [2025-03-16 20:08:46,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:46,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:46,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:46,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:46,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:46,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:46,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458527290] [2025-03-16 20:08:46,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458527290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:46,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:46,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:46,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937787563] [2025-03-16 20:08:46,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:46,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:46,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:46,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:46,370 INFO L87 Difference]: Start difference. First operand 17049 states and 29659 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:47,196 INFO L93 Difference]: Finished difference Result 36859 states and 65485 transitions. [2025-03-16 20:08:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:47,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:47,266 INFO L225 Difference]: With dead ends: 36859 [2025-03-16 20:08:47,267 INFO L226 Difference]: Without dead ends: 21949 [2025-03-16 20:08:47,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:47,312 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4732 mSDsluCounter, 8624 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4752 SdHoareTripleChecker+Valid, 13013 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:47,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4752 Valid, 13013 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21949 states. [2025-03-16 20:08:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21949 to 17049. [2025-03-16 20:08:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17049 states, 15939 states have (on average 1.7068824894911852) internal successors, (27206), 16153 states have internal predecessors, (27206), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:08:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17049 states to 17049 states and 29626 transitions. [2025-03-16 20:08:47,903 INFO L78 Accepts]: Start accepts. Automaton has 17049 states and 29626 transitions. Word has length 161 [2025-03-16 20:08:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:47,903 INFO L471 AbstractCegarLoop]: Abstraction has 17049 states and 29626 transitions. [2025-03-16 20:08:47,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17049 states and 29626 transitions. [2025-03-16 20:08:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:47,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:47,910 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] [2025-03-16 20:08:47,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:08:47,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -891880945, now seen corresponding path program 1 times [2025-03-16 20:08:47,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:47,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055185078] [2025-03-16 20:08:47,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:47,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:47,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:47,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:47,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055185078] [2025-03-16 20:08:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055185078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110892430] [2025-03-16 20:08:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:47,998 INFO L87 Difference]: Start difference. First operand 17049 states and 29626 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:48,658 INFO L93 Difference]: Finished difference Result 36614 states and 64929 transitions. [2025-03-16 20:08:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:48,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:48,726 INFO L225 Difference]: With dead ends: 36614 [2025-03-16 20:08:48,727 INFO L226 Difference]: Without dead ends: 21704 [2025-03-16 20:08:48,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:48,759 INFO L435 NwaCegarLoop]: 4386 mSDtfsCounter, 4729 mSDsluCounter, 8619 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4749 SdHoareTripleChecker+Valid, 13005 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:48,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4749 Valid, 13005 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21704 states. [2025-03-16 20:08:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21704 to 17049. [2025-03-16 20:08:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17049 states, 15939 states have (on average 1.704812096116444) internal successors, (27173), 16153 states have internal predecessors, (27173), 698 states have call successors, (698), 198 states have call predecessors, (698), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:08:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17049 states to 17049 states and 29593 transitions. [2025-03-16 20:08:49,276 INFO L78 Accepts]: Start accepts. Automaton has 17049 states and 29593 transitions. Word has length 161 [2025-03-16 20:08:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:49,277 INFO L471 AbstractCegarLoop]: Abstraction has 17049 states and 29593 transitions. [2025-03-16 20:08:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 17049 states and 29593 transitions. [2025-03-16 20:08:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:49,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:49,284 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] [2025-03-16 20:08:49,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:08:49,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:49,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -747471250, now seen corresponding path program 1 times [2025-03-16 20:08:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:49,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684813810] [2025-03-16 20:08:49,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:49,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:49,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:49,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:49,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684813810] [2025-03-16 20:08:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684813810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564195090] [2025-03-16 20:08:49,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:49,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:49,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:49,382 INFO L87 Difference]: Start difference. First operand 17049 states and 29593 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:50,925 INFO L93 Difference]: Finished difference Result 51509 states and 91497 transitions. [2025-03-16 20:08:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:50,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:51,075 INFO L225 Difference]: With dead ends: 51509 [2025-03-16 20:08:51,075 INFO L226 Difference]: Without dead ends: 36599 [2025-03-16 20:08:51,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:51,129 INFO L435 NwaCegarLoop]: 4696 mSDtfsCounter, 5027 mSDsluCounter, 14143 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5047 SdHoareTripleChecker+Valid, 18839 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:51,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5047 Valid, 18839 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36599 states. [2025-03-16 20:08:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36599 to 35940. [2025-03-16 20:08:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35940 states, 33512 states have (on average 1.7233528288374313) internal successors, (57753), 34180 states have internal predecessors, (57753), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:08:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35940 states to 35940 states and 64589 transitions. [2025-03-16 20:08:52,383 INFO L78 Accepts]: Start accepts. Automaton has 35940 states and 64589 transitions. Word has length 161 [2025-03-16 20:08:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 35940 states and 64589 transitions. [2025-03-16 20:08:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 35940 states and 64589 transitions. [2025-03-16 20:08:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:52,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:52,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] [2025-03-16 20:08:52,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:08:52,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:52,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:52,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1019907537, now seen corresponding path program 1 times [2025-03-16 20:08:52,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:52,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549584155] [2025-03-16 20:08:52,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:52,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:52,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:52,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:52,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:52,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549584155] [2025-03-16 20:08:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549584155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:52,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:52,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646709478] [2025-03-16 20:08:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:52,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:52,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:52,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:52,479 INFO L87 Difference]: Start difference. First operand 35940 states and 64589 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:53,726 INFO L93 Difference]: Finished difference Result 82168 states and 152077 transitions. [2025-03-16 20:08:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:53,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:53,908 INFO L225 Difference]: With dead ends: 82168 [2025-03-16 20:08:53,908 INFO L226 Difference]: Without dead ends: 48367 [2025-03-16 20:08:54,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:54,004 INFO L435 NwaCegarLoop]: 4381 mSDtfsCounter, 4725 mSDsluCounter, 8610 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4745 SdHoareTripleChecker+Valid, 12991 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:54,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4745 Valid, 12991 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48367 states. [2025-03-16 20:08:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48367 to 35940. [2025-03-16 20:08:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35940 states, 33512 states have (on average 1.7214132251133922) internal successors, (57688), 34180 states have internal predecessors, (57688), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:08:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35940 states to 35940 states and 64524 transitions. [2025-03-16 20:08:55,390 INFO L78 Accepts]: Start accepts. Automaton has 35940 states and 64524 transitions. Word has length 161 [2025-03-16 20:08:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:55,392 INFO L471 AbstractCegarLoop]: Abstraction has 35940 states and 64524 transitions. [2025-03-16 20:08:55,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35940 states and 64524 transitions. [2025-03-16 20:08:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:55,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:55,403 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] [2025-03-16 20:08:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:08:55,403 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1465156174, now seen corresponding path program 1 times [2025-03-16 20:08:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118592816] [2025-03-16 20:08:55,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:55,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:55,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:55,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:55,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:55,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118592816] [2025-03-16 20:08:55,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118592816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:55,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:55,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5939632] [2025-03-16 20:08:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:55,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:55,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:55,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:55,656 INFO L87 Difference]: Start difference. First operand 35940 states and 64524 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:57,360 INFO L93 Difference]: Finished difference Result 81437 states and 150485 transitions. [2025-03-16 20:08:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:08:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:57,508 INFO L225 Difference]: With dead ends: 81437 [2025-03-16 20:08:57,508 INFO L226 Difference]: Without dead ends: 47636 [2025-03-16 20:08:57,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:57,593 INFO L435 NwaCegarLoop]: 4378 mSDtfsCounter, 4722 mSDsluCounter, 8605 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4742 SdHoareTripleChecker+Valid, 12983 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:57,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4742 Valid, 12983 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47636 states. [2025-03-16 20:08:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47636 to 35940. [2025-03-16 20:08:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35940 states, 33512 states have (on average 1.7194736213893531) internal successors, (57623), 34180 states have internal predecessors, (57623), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:08:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35940 states to 35940 states and 64459 transitions. [2025-03-16 20:08:59,480 INFO L78 Accepts]: Start accepts. Automaton has 35940 states and 64459 transitions. Word has length 161 [2025-03-16 20:08:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:59,481 INFO L471 AbstractCegarLoop]: Abstraction has 35940 states and 64459 transitions. [2025-03-16 20:08:59,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35940 states and 64459 transitions. [2025-03-16 20:08:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:08:59,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:59,491 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] [2025-03-16 20:08:59,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:08:59,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 991130191, now seen corresponding path program 1 times [2025-03-16 20:08:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948810270] [2025-03-16 20:08:59,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:59,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:08:59,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:08:59,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:59,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:59,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948810270] [2025-03-16 20:08:59,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948810270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169302188] [2025-03-16 20:08:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:59,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:59,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:59,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:59,572 INFO L87 Difference]: Start difference. First operand 35940 states and 64459 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:09:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:09:00,992 INFO L93 Difference]: Finished difference Result 80706 states and 148893 transitions. [2025-03-16 20:09:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:09:00,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:09:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:09:01,142 INFO L225 Difference]: With dead ends: 80706 [2025-03-16 20:09:01,142 INFO L226 Difference]: Without dead ends: 46905 [2025-03-16 20:09:01,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:09:01,213 INFO L435 NwaCegarLoop]: 4375 mSDtfsCounter, 4719 mSDsluCounter, 8600 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4739 SdHoareTripleChecker+Valid, 12975 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:09:01,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4739 Valid, 12975 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:09:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46905 states. [2025-03-16 20:09:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46905 to 35940. [2025-03-16 20:09:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35940 states, 33512 states have (on average 1.717534017665314) internal successors, (57558), 34180 states have internal predecessors, (57558), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:09:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35940 states to 35940 states and 64394 transitions. [2025-03-16 20:09:02,541 INFO L78 Accepts]: Start accepts. Automaton has 35940 states and 64394 transitions. Word has length 161 [2025-03-16 20:09:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:09:02,541 INFO L471 AbstractCegarLoop]: Abstraction has 35940 states and 64394 transitions. [2025-03-16 20:09:02,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:09:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 35940 states and 64394 transitions. [2025-03-16 20:09:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:09:02,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:09:02,551 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] [2025-03-16 20:09:02,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:09:02,552 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:09:02,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:09:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash 698744366, now seen corresponding path program 1 times [2025-03-16 20:09:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:09:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245288987] [2025-03-16 20:09:02,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:09:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:09:02,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:09:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:09:02,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:09:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:09:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:09:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:09:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245288987] [2025-03-16 20:09:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245288987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:09:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:09:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:09:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528245114] [2025-03-16 20:09:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:09:02,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:09:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:09:02,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:09:02,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:09:02,658 INFO L87 Difference]: Start difference. First operand 35940 states and 64394 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:09:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:09:06,343 INFO L93 Difference]: Finished difference Result 119186 states and 220771 transitions. [2025-03-16 20:09:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:09:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2025-03-16 20:09:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:09:06,699 INFO L225 Difference]: With dead ends: 119186 [2025-03-16 20:09:06,699 INFO L226 Difference]: Without dead ends: 85385 [2025-03-16 20:09:06,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:09:06,842 INFO L435 NwaCegarLoop]: 4427 mSDtfsCounter, 5150 mSDsluCounter, 13483 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5169 SdHoareTripleChecker+Valid, 17910 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:09:06,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5169 Valid, 17910 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:09:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85385 states. [2025-03-16 20:09:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85385 to 79362. [2025-03-16 20:09:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79362 states, 73876 states have (on average 1.740375764795062) internal successors, (128572), 75938 states have internal predecessors, (128572), 2650 states have call successors, (2650), 774 states have call predecessors, (2650), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-03-16 20:09:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79362 states to 79362 states and 150256 transitions. [2025-03-16 20:09:09,712 INFO L78 Accepts]: Start accepts. Automaton has 79362 states and 150256 transitions. Word has length 161 [2025-03-16 20:09:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:09:09,713 INFO L471 AbstractCegarLoop]: Abstraction has 79362 states and 150256 transitions. [2025-03-16 20:09:09,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:09:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 79362 states and 150256 transitions. [2025-03-16 20:09:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 20:09:09,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:09:09,728 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] [2025-03-16 20:09:09,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:09:09,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:09:09,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:09:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1665992081, now seen corresponding path program 1 times [2025-03-16 20:09:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:09:09,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506674901] [2025-03-16 20:09:09,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:09:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:09:09,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 20:09:09,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 20:09:09,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:09:09,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:09:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:09:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:09:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506674901] [2025-03-16 20:09:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506674901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:09:09,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:09:09,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:09:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156907294] [2025-03-16 20:09:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:09:09,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:09:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:09:09,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:09:09,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:09:09,804 INFO L87 Difference]: Start difference. First operand 79362 states and 150256 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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)