./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfa23a07aa8a02ca6771de75de8be171cc21a8c2878b440538c1944a91ea1c1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:43:01,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:43:01,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:43:01,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:43:01,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:43:01,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:43:01,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:43:01,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:43:01,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:43:01,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:43:01,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:43:01,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:43:01,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:43:01,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:43:01,471 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:43:01,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:43:01,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:43:01,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:43:01,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:43:01,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:43:01,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:43:01,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:43:01,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:43:01,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:43:01,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:43:01,473 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 -> bfa23a07aa8a02ca6771de75de8be171cc21a8c2878b440538c1944a91ea1c1d [2025-03-03 15:43:01,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:43:01,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:43:01,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:43:01,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:43:01,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:43:01,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c [2025-03-03 15:43:02,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024b72199/aef0ed67d03646b59f8642c2c295deaa/FLAGcbebfaa72 [2025-03-03 15:43:03,519 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:43:03,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.08.cil-1.c [2025-03-03 15:43:03,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024b72199/aef0ed67d03646b59f8642c2c295deaa/FLAGcbebfaa72 [2025-03-03 15:43:03,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024b72199/aef0ed67d03646b59f8642c2c295deaa [2025-03-03 15:43:03,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:43:03,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:43:03,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:43:03,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:43:03,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:43:03,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:43:03" (1/1) ... [2025-03-03 15:43:03,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afb79a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:03, skipping insertion in model container [2025-03-03 15:43:03,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:43:03" (1/1) ... [2025-03-03 15:43:04,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:43:05,232 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_label45+token_ring.08.cil-1.c[380323,380336] [2025-03-03 15:43:05,260 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_label45+token_ring.08.cil-1.c[383339,383352] [2025-03-03 15:43:05,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:43:05,474 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:43:05,993 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_label45+token_ring.08.cil-1.c[380323,380336] [2025-03-03 15:43:05,997 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_label45+token_ring.08.cil-1.c[383339,383352] [2025-03-03 15:43:06,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:43:06,061 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:43:06,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06 WrapperNode [2025-03-03 15:43:06,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:43:06,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:43:06,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:43:06,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:43:06,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,443 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-03 15:43:06,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:43:06,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:43:06,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:43:06,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:43:06,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,577 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:43:06,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:43:06,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:43:06,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:43:06,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:43:06,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (1/1) ... [2025-03-03 15:43:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:43:06,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:43:06,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:43:07,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:43:07,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:43:07,031 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:43:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:43:07,031 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:43:07,031 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:43:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:43:07,032 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:43:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:43:07,032 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:43:07,032 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:43:07,032 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:43:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:43:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:43:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:43:07,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:43:07,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:43:07,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:43:07,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:43:13,515 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:43:13,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:43:13,516 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:43:13,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:43:13,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:43:13,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:43:13,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:43:13,738 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-03-03 15:43:13,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:43:13,789 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:43:13,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:43:13,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:43:13 BoogieIcfgContainer [2025-03-03 15:43:13,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:43:13,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:43:13,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:43:13,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:43:13,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:43:03" (1/3) ... [2025-03-03 15:43:13,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66260ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:43:13, skipping insertion in model container [2025-03-03 15:43:13,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:43:06" (2/3) ... [2025-03-03 15:43:13,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66260ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:43:13, skipping insertion in model container [2025-03-03 15:43:13,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:43:13" (3/3) ... [2025-03-03 15:43:13,800 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.08.cil-1.c [2025-03-03 15:43:13,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:43:13,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.08.cil-1.c that has 7 procedures, 2483 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-03 15:43:13,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:43:13,964 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;@55292f2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:43:13,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:43:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 15:43:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:13,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:13,990 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] [2025-03-03 15:43:13,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:13,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash 840339491, now seen corresponding path program 1 times [2025-03-03 15:43:14,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:14,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963078356] [2025-03-03 15:43:14,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:14,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:14,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:14,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:14,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:14,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-03 15:43:14,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963078356] [2025-03-03 15:43:14,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963078356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:14,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:14,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:14,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110853488] [2025-03-03 15:43:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:14,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:14,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:14,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:14,532 INFO L87 Difference]: Start difference. First operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:15,163 INFO L93 Difference]: Finished difference Result 5264 states and 9573 transitions. [2025-03-03 15:43:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:43:15,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:15,190 INFO L225 Difference]: With dead ends: 5264 [2025-03-03 15:43:15,190 INFO L226 Difference]: Without dead ends: 2727 [2025-03-03 15:43:15,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:15,203 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4854 mSDsluCounter, 8959 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4870 SdHoareTripleChecker+Valid, 13339 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:15,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4870 Valid, 13339 Invalid, 516 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:43:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-03-03 15:43:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2706. [2025-03-03 15:43:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7997737556561086) internal successors, (4773), 2655 states have internal predecessors, (4773), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-03 15:43:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4852 transitions. [2025-03-03 15:43:15,334 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4852 transitions. Word has length 134 [2025-03-03 15:43:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:15,336 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4852 transitions. [2025-03-03 15:43:15,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4852 transitions. [2025-03-03 15:43:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:15,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:15,341 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] [2025-03-03 15:43:15,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:43:15,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:15,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:15,342 INFO L85 PathProgramCache]: Analyzing trace with hash -12912283, now seen corresponding path program 1 times [2025-03-03 15:43:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:15,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859899138] [2025-03-03 15:43:15,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:15,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:15,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:15,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:15,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:15,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:15,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859899138] [2025-03-03 15:43:15,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859899138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:15,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103747443] [2025-03-03 15:43:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:15,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:15,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:15,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:15,517 INFO L87 Difference]: Start difference. First operand 2706 states and 4852 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:15,825 INFO L93 Difference]: Finished difference Result 3329 states and 5825 transitions. [2025-03-03 15:43:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:15,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:15,836 INFO L225 Difference]: With dead ends: 3329 [2025-03-03 15:43:15,837 INFO L226 Difference]: Without dead ends: 2760 [2025-03-03 15:43:15,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:15,840 INFO L435 NwaCegarLoop]: 4299 mSDtfsCounter, 4553 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 12782 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:15,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 12782 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:43:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2025-03-03 15:43:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2706. [2025-03-03 15:43:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7990196078431373) internal successors, (4771), 2655 states have internal predecessors, (4771), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-03 15:43:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4850 transitions. [2025-03-03 15:43:15,971 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4850 transitions. Word has length 134 [2025-03-03 15:43:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:15,975 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4850 transitions. [2025-03-03 15:43:15,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4850 transitions. [2025-03-03 15:43:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:15,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:15,976 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] [2025-03-03 15:43:15,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:43:15,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1159452796, now seen corresponding path program 1 times [2025-03-03 15:43:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65278602] [2025-03-03 15:43:15,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:15,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65278602] [2025-03-03 15:43:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65278602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:16,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:16,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359177036] [2025-03-03 15:43:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:16,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:16,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:16,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:16,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:16,311 INFO L87 Difference]: Start difference. First operand 2706 states and 4850 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:16,920 INFO L93 Difference]: Finished difference Result 3634 states and 6288 transitions. [2025-03-03 15:43:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:16,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:16,939 INFO L225 Difference]: With dead ends: 3634 [2025-03-03 15:43:16,939 INFO L226 Difference]: Without dead ends: 3065 [2025-03-03 15:43:16,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:16,943 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 4781 mSDsluCounter, 13683 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4797 SdHoareTripleChecker+Valid, 18231 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:16,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4797 Valid, 18231 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:43:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2025-03-03 15:43:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2976. [2025-03-03 15:43:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2898 states have (on average 1.7736369910282954) internal successors, (5140), 2902 states have internal predecessors, (5140), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-03 15:43:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5256 transitions. [2025-03-03 15:43:17,021 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5256 transitions. Word has length 134 [2025-03-03 15:43:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:17,021 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5256 transitions. [2025-03-03 15:43:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5256 transitions. [2025-03-03 15:43:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:17,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:17,024 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] [2025-03-03 15:43:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:43:17,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1851603333, now seen corresponding path program 1 times [2025-03-03 15:43:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674500944] [2025-03-03 15:43:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:17,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:17,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:17,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:17,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674500944] [2025-03-03 15:43:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674500944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:17,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:17,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981435232] [2025-03-03 15:43:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:17,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:17,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:17,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:17,168 INFO L87 Difference]: Start difference. First operand 2976 states and 5256 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:17,720 INFO L93 Difference]: Finished difference Result 4487 states and 7591 transitions. [2025-03-03 15:43:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:17,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:17,735 INFO L225 Difference]: With dead ends: 4487 [2025-03-03 15:43:17,736 INFO L226 Difference]: Without dead ends: 3648 [2025-03-03 15:43:17,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:17,740 INFO L435 NwaCegarLoop]: 4544 mSDtfsCounter, 4776 mSDsluCounter, 13671 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4792 SdHoareTripleChecker+Valid, 18215 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:17,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4792 Valid, 18215 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:43:17,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2025-03-03 15:43:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3547. [2025-03-03 15:43:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3419 states have (on average 1.7353027200935947) internal successors, (5933), 3427 states have internal predecessors, (5933), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-03 15:43:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 6129 transitions. [2025-03-03 15:43:17,877 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 6129 transitions. Word has length 134 [2025-03-03 15:43:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:17,877 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 6129 transitions. [2025-03-03 15:43:17,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 6129 transitions. [2025-03-03 15:43:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:17,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:17,879 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] [2025-03-03 15:43:17,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:43:17,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:17,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2087281508, now seen corresponding path program 1 times [2025-03-03 15:43:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548626758] [2025-03-03 15:43:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:17,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:17,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:17,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:17,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548626758] [2025-03-03 15:43:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548626758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865121279] [2025-03-03 15:43:18,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:18,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:18,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:18,019 INFO L87 Difference]: Start difference. First operand 3547 states and 6129 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:18,537 INFO L93 Difference]: Finished difference Result 6312 states and 10438 transitions. [2025-03-03 15:43:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:18,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:18,558 INFO L225 Difference]: With dead ends: 6312 [2025-03-03 15:43:18,558 INFO L226 Difference]: Without dead ends: 4902 [2025-03-03 15:43:18,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:18,566 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 4797 mSDsluCounter, 13155 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 17486 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:18,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 17486 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:43:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-03-03 15:43:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4776. [2025-03-03 15:43:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4542 states have (on average 1.6893439013650375) internal successors, (7673), 4564 states have internal predecessors, (7673), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-03 15:43:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 8053 transitions. [2025-03-03 15:43:18,706 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 8053 transitions. Word has length 134 [2025-03-03 15:43:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:18,706 INFO L471 AbstractCegarLoop]: Abstraction has 4776 states and 8053 transitions. [2025-03-03 15:43:18,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 8053 transitions. [2025-03-03 15:43:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:18,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:18,708 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] [2025-03-03 15:43:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:43:18,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1263600037, now seen corresponding path program 1 times [2025-03-03 15:43:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719962273] [2025-03-03 15:43:18,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:18,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:18,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:18,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:18,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:18,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:18,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719962273] [2025-03-03 15:43:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719962273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:18,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696476702] [2025-03-03 15:43:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:18,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:18,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:18,826 INFO L87 Difference]: Start difference. First operand 4776 states and 8053 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:19,442 INFO L93 Difference]: Finished difference Result 10291 states and 16832 transitions. [2025-03-03 15:43:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:19,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:19,474 INFO L225 Difference]: With dead ends: 10291 [2025-03-03 15:43:19,475 INFO L226 Difference]: Without dead ends: 7652 [2025-03-03 15:43:19,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:19,485 INFO L435 NwaCegarLoop]: 4538 mSDtfsCounter, 4766 mSDsluCounter, 13653 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 18191 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:19,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 18191 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:43:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2025-03-03 15:43:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7477. [2025-03-03 15:43:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7477 states, 7013 states have (on average 1.6513617567374874) internal successors, (11581), 7081 states have internal predecessors, (11581), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-03 15:43:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 12425 transitions. [2025-03-03 15:43:19,682 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 12425 transitions. Word has length 134 [2025-03-03 15:43:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:19,682 INFO L471 AbstractCegarLoop]: Abstraction has 7477 states and 12425 transitions. [2025-03-03 15:43:19,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 12425 transitions. [2025-03-03 15:43:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:19,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:19,686 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] [2025-03-03 15:43:19,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:43:19,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1949558972, now seen corresponding path program 1 times [2025-03-03 15:43:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61519162] [2025-03-03 15:43:19,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:19,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:19,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61519162] [2025-03-03 15:43:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61519162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908868877] [2025-03-03 15:43:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:19,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:19,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:19,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:19,791 INFO L87 Difference]: Start difference. First operand 7477 states and 12425 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:20,680 INFO L93 Difference]: Finished difference Result 19162 states and 31698 transitions. [2025-03-03 15:43:20,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:20,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:20,723 INFO L225 Difference]: With dead ends: 19162 [2025-03-03 15:43:20,724 INFO L226 Difference]: Without dead ends: 13822 [2025-03-03 15:43:20,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:20,744 INFO L435 NwaCegarLoop]: 4535 mSDtfsCounter, 4761 mSDsluCounter, 13644 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 18179 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:20,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18179 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:43:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-03-03 15:43:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13554. [2025-03-03 15:43:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6362118320610688) internal successors, (20577), 12790 states have internal predecessors, (20577), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-03 15:43:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22733 transitions. [2025-03-03 15:43:21,118 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22733 transitions. Word has length 134 [2025-03-03 15:43:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:21,118 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22733 transitions. [2025-03-03 15:43:21,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22733 transitions. [2025-03-03 15:43:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:21,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:21,126 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] [2025-03-03 15:43:21,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:43:21,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:21,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1826116037, now seen corresponding path program 1 times [2025-03-03 15:43:21,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108427643] [2025-03-03 15:43:21,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:21,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:21,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108427643] [2025-03-03 15:43:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108427643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:21,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652564944] [2025-03-03 15:43:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:21,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:21,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:21,218 INFO L87 Difference]: Start difference. First operand 13554 states and 22733 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:21,730 INFO L93 Difference]: Finished difference Result 27911 states and 47718 transitions. [2025-03-03 15:43:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:21,826 INFO L225 Difference]: With dead ends: 27911 [2025-03-03 15:43:21,827 INFO L226 Difference]: Without dead ends: 16494 [2025-03-03 15:43:21,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:21,868 INFO L435 NwaCegarLoop]: 4286 mSDtfsCounter, 4545 mSDsluCounter, 8458 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 12744 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:21,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 12744 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:43:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16494 states. [2025-03-03 15:43:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16494 to 13554. [2025-03-03 15:43:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.633587786259542) internal successors, (20544), 12790 states have internal predecessors, (20544), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-03 15:43:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22700 transitions. [2025-03-03 15:43:22,546 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22700 transitions. Word has length 134 [2025-03-03 15:43:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:22,547 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22700 transitions. [2025-03-03 15:43:22,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22700 transitions. [2025-03-03 15:43:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:22,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:22,554 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] [2025-03-03 15:43:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:43:22,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:22,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:22,555 INFO L85 PathProgramCache]: Analyzing trace with hash 839533348, now seen corresponding path program 1 times [2025-03-03 15:43:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865664550] [2025-03-03 15:43:22,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:22,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:22,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865664550] [2025-03-03 15:43:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865664550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731264824] [2025-03-03 15:43:22,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:22,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:22,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:22,702 INFO L87 Difference]: Start difference. First operand 13554 states and 22700 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:23,236 INFO L93 Difference]: Finished difference Result 27666 states and 47162 transitions. [2025-03-03 15:43:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:23,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:23,277 INFO L225 Difference]: With dead ends: 27666 [2025-03-03 15:43:23,277 INFO L226 Difference]: Without dead ends: 16249 [2025-03-03 15:43:23,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:23,295 INFO L435 NwaCegarLoop]: 4283 mSDtfsCounter, 4542 mSDsluCounter, 8453 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 12736 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:23,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4558 Valid, 12736 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:43:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states. [2025-03-03 15:43:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16249 to 13554. [2025-03-03 15:43:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6309637404580153) internal successors, (20511), 12790 states have internal predecessors, (20511), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-03 15:43:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22667 transitions. [2025-03-03 15:43:23,805 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22667 transitions. Word has length 134 [2025-03-03 15:43:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22667 transitions. [2025-03-03 15:43:23,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22667 transitions. [2025-03-03 15:43:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:23,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:23,815 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] [2025-03-03 15:43:23,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:43:23,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:23,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1916086757, now seen corresponding path program 1 times [2025-03-03 15:43:23,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:23,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655813634] [2025-03-03 15:43:23,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:23,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:23,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:23,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:23,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655813634] [2025-03-03 15:43:23,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655813634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:23,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:23,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791066066] [2025-03-03 15:43:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:23,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:23,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:23,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:23,981 INFO L87 Difference]: Start difference. First operand 13554 states and 22667 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:25,096 INFO L93 Difference]: Finished difference Result 40825 states and 69395 transitions. [2025-03-03 15:43:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:25,180 INFO L225 Difference]: With dead ends: 40825 [2025-03-03 15:43:25,180 INFO L226 Difference]: Without dead ends: 29408 [2025-03-03 15:43:25,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:25,205 INFO L435 NwaCegarLoop]: 4520 mSDtfsCounter, 4994 mSDsluCounter, 13596 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 18116 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:25,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 18116 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:43:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29408 states. [2025-03-03 15:43:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29408 to 26989. [2025-03-03 15:43:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.634691988894701) internal successors, (40627), 25521 states have internal predecessors, (40627), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-03 15:43:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46879 transitions. [2025-03-03 15:43:26,394 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46879 transitions. Word has length 134 [2025-03-03 15:43:26,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:26,394 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46879 transitions. [2025-03-03 15:43:26,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46879 transitions. [2025-03-03 15:43:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:26,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:26,404 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] [2025-03-03 15:43:26,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:43:26,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:26,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash -543037692, now seen corresponding path program 1 times [2025-03-03 15:43:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208778875] [2025-03-03 15:43:26,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:26,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:26,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:26,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:26,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208778875] [2025-03-03 15:43:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208778875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235972797] [2025-03-03 15:43:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:26,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:26,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:26,488 INFO L87 Difference]: Start difference. First operand 26989 states and 46879 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:27,590 INFO L93 Difference]: Finished difference Result 58420 states and 104966 transitions. [2025-03-03 15:43:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:27,779 INFO L225 Difference]: With dead ends: 58420 [2025-03-03 15:43:27,779 INFO L226 Difference]: Without dead ends: 33568 [2025-03-03 15:43:27,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:27,850 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4536 mSDsluCounter, 8442 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4552 SdHoareTripleChecker+Valid, 12720 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:27,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4552 Valid, 12720 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:43:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33568 states. [2025-03-03 15:43:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33568 to 26989. [2025-03-03 15:43:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.632076610469561) internal successors, (40562), 25521 states have internal predecessors, (40562), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-03 15:43:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46814 transitions. [2025-03-03 15:43:28,835 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46814 transitions. Word has length 134 [2025-03-03 15:43:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46814 transitions. [2025-03-03 15:43:28,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46814 transitions. [2025-03-03 15:43:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:28,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:28,846 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] [2025-03-03 15:43:28,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:43:28,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:28,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:28,847 INFO L85 PathProgramCache]: Analyzing trace with hash -483816955, now seen corresponding path program 1 times [2025-03-03 15:43:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805255049] [2025-03-03 15:43:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:28,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:28,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:28,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:28,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805255049] [2025-03-03 15:43:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805255049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:29,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:29,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:29,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255892270] [2025-03-03 15:43:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:29,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:29,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:29,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:29,100 INFO L87 Difference]: Start difference. First operand 26989 states and 46814 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:31,614 INFO L93 Difference]: Finished difference Result 85774 states and 155330 transitions. [2025-03-03 15:43:31,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:31,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:31,834 INFO L225 Difference]: With dead ends: 85774 [2025-03-03 15:43:31,835 INFO L226 Difference]: Without dead ends: 60922 [2025-03-03 15:43:31,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:31,904 INFO L435 NwaCegarLoop]: 4512 mSDtfsCounter, 4921 mSDsluCounter, 13573 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4946 SdHoareTripleChecker+Valid, 18085 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:31,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4946 Valid, 18085 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:43:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60922 states. [2025-03-03 15:43:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60922 to 57165. [2025-03-03 15:43:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6452668439885954) internal successors, (85980), 54321 states have internal predecessors, (85980), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-03 15:43:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106504 transitions. [2025-03-03 15:43:34,876 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106504 transitions. Word has length 134 [2025-03-03 15:43:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:34,877 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106504 transitions. [2025-03-03 15:43:34,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106504 transitions. [2025-03-03 15:43:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:34,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:34,896 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] [2025-03-03 15:43:34,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:43:34,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:34,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 210830052, now seen corresponding path program 1 times [2025-03-03 15:43:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182925287] [2025-03-03 15:43:34,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:34,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:34,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:34,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:34,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182925287] [2025-03-03 15:43:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182925287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:35,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625716637] [2025-03-03 15:43:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:35,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:35,028 INFO L87 Difference]: Start difference. First operand 57165 states and 106504 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:37,574 INFO L93 Difference]: Finished difference Result 127516 states and 249746 transitions. [2025-03-03 15:43:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:37,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:37,900 INFO L225 Difference]: With dead ends: 127516 [2025-03-03 15:43:37,900 INFO L226 Difference]: Without dead ends: 72488 [2025-03-03 15:43:38,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:38,127 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 4543 mSDsluCounter, 8420 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4559 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:38,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4559 Valid, 12680 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:43:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72488 states. [2025-03-03 15:43:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72488 to 57165. [2025-03-03 15:43:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6427983696588147) internal successors, (85851), 54321 states have internal predecessors, (85851), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-03 15:43:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106375 transitions. [2025-03-03 15:43:43,165 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106375 transitions. Word has length 134 [2025-03-03 15:43:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:43,166 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106375 transitions. [2025-03-03 15:43:43,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106375 transitions. [2025-03-03 15:43:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:43,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:43,181 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] [2025-03-03 15:43:43,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:43:43,182 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:43,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:43,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1341616677, now seen corresponding path program 1 times [2025-03-03 15:43:43,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:43,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724280920] [2025-03-03 15:43:43,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:43,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:43,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:43,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:43,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724280920] [2025-03-03 15:43:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724280920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:43,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:43:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222545481] [2025-03-03 15:43:43,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:43,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:43:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:43,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:43:43,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:43:43,246 INFO L87 Difference]: Start difference. First operand 57165 states and 106375 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:45,808 INFO L93 Difference]: Finished difference Result 125327 states and 245110 transitions. [2025-03-03 15:43:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:43:45,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:46,117 INFO L225 Difference]: With dead ends: 125327 [2025-03-03 15:43:46,118 INFO L226 Difference]: Without dead ends: 70299 [2025-03-03 15:43:46,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:46,249 INFO L435 NwaCegarLoop]: 4270 mSDtfsCounter, 4529 mSDsluCounter, 8428 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4545 SdHoareTripleChecker+Valid, 12698 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:46,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4545 Valid, 12698 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:43:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70299 states. [2025-03-03 15:43:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70299 to 57165. [2025-03-03 15:43:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6403298953290342) internal successors, (85722), 54321 states have internal predecessors, (85722), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-03 15:43:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106246 transitions. [2025-03-03 15:43:50,605 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106246 transitions. Word has length 134 [2025-03-03 15:43:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:43:50,605 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106246 transitions. [2025-03-03 15:43:50,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106246 transitions. [2025-03-03 15:43:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:43:50,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:43:50,622 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] [2025-03-03 15:43:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:43:50,623 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:43:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:43:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 408262340, now seen corresponding path program 1 times [2025-03-03 15:43:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:43:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131387598] [2025-03-03 15:43:50,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:43:50,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:43:50,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:43:50,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:43:50,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:43:50,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:43:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:43:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:43:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131387598] [2025-03-03 15:43:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131387598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:43:50,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:43:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:43:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163002492] [2025-03-03 15:43:50,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:43:50,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:43:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:43:50,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:43:50,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:43:50,741 INFO L87 Difference]: Start difference. First operand 57165 states and 106246 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:43:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:43:55,414 INFO L93 Difference]: Finished difference Result 181844 states and 364944 transitions. [2025-03-03 15:43:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:43:55,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-03-03 15:43:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:43:56,028 INFO L225 Difference]: With dead ends: 181844 [2025-03-03 15:43:56,028 INFO L226 Difference]: Without dead ends: 126816 [2025-03-03 15:43:56,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:43:56,235 INFO L435 NwaCegarLoop]: 4499 mSDtfsCounter, 4810 mSDsluCounter, 13536 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4835 SdHoareTripleChecker+Valid, 18035 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:43:56,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4835 Valid, 18035 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:43:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126816 states.