./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:24:09,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:24:09,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:24:09,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:24:09,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:24:09,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:24:09,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:24:09,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:24:09,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:24:09,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:24:09,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:24:09,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:24:09,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:24:09,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:24:09,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:24:09,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:24:09,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:24:09,975 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 -> f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a [2025-03-03 16:24:10,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:24:10,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:24:10,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:24:10,197 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:24:10,197 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:24:10,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2025-03-03 16:24:11,308 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454347e57/3f78d03bd369438496ebea5aaf1bb164/FLAG0e6aed50e [2025-03-03 16:24:11,609 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:24:11,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2025-03-03 16:24:11,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454347e57/3f78d03bd369438496ebea5aaf1bb164/FLAG0e6aed50e [2025-03-03 16:24:11,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454347e57/3f78d03bd369438496ebea5aaf1bb164 [2025-03-03 16:24:11,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:24:11,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:24:11,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:24:11,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:24:11,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:24:11,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:11,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11, skipping insertion in model container [2025-03-03 16:24:11,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:11,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:24:11,791 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/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2025-03-03 16:24:11,840 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/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2025-03-03 16:24:11,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:24:11,916 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:24:11,925 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/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2025-03-03 16:24:11,943 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/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2025-03-03 16:24:11,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:24:11,999 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:24:11,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11 WrapperNode [2025-03-03 16:24:11,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:24:12,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:24:12,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:24:12,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:24:12,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,059 INFO L138 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 935 [2025-03-03 16:24:12,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:24:12,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:24:12,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:24:12,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:24:12,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,083 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 16:24:12,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,091 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:24:12,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:24:12,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:24:12,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:24:12,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (1/1) ... [2025-03-03 16:24:12,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:24:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:24:12,128 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 16:24:12,131 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 16:24:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:24:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:24:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:24:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:24:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:24:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:24:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:24:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:24:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:24:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:24:12,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:24:12,150 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:24:12,151 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:24:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:24:12,151 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:24:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:24:12,151 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:24:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:24:12,151 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:24:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:24:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:24:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:24:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:24:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:24:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:24:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:24:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:24:12,152 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:24:12,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:24:12,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:24:12,153 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:24:12,153 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:24:12,257 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:24:12,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:24:12,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-03 16:24:12,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-03 16:24:12,865 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-03 16:24:13,028 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-03 16:24:13,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:24:13,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:24:13,052 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:24:13,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:24:13 BoogieIcfgContainer [2025-03-03 16:24:13,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:24:13,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:24:13,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:24:13,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:24:13,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:24:11" (1/3) ... [2025-03-03 16:24:13,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64181a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:24:13, skipping insertion in model container [2025-03-03 16:24:13,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:11" (2/3) ... [2025-03-03 16:24:13,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64181a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:24:13, skipping insertion in model container [2025-03-03 16:24:13,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:24:13" (3/3) ... [2025-03-03 16:24:13,061 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-2.c [2025-03-03 16:24:13,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:24:13,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.10.cil-2.c that has 15 procedures, 473 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-03-03 16:24:13,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:24:13,143 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;@6e7ae907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:24:13,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:24:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 473 states, 416 states have (on average 1.5528846153846154) internal successors, (646), 422 states have internal predecessors, (646), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 16:24:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:13,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:13,156 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] [2025-03-03 16:24:13,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:13,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1430008783, now seen corresponding path program 1 times [2025-03-03 16:24:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:13,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133300728] [2025-03-03 16:24:13,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:13,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:13,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:13,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:13,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:13,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:13,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:13,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133300728] [2025-03-03 16:24:13,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133300728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:13,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:13,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964396783] [2025-03-03 16:24:13,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:13,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:13,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:13,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:13,597 INFO L87 Difference]: Start difference. First operand has 473 states, 416 states have (on average 1.5528846153846154) internal successors, (646), 422 states have internal predecessors, (646), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:14,411 INFO L93 Difference]: Finished difference Result 1041 states and 1593 transitions. [2025-03-03 16:24:14,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:24:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:14,427 INFO L225 Difference]: With dead ends: 1041 [2025-03-03 16:24:14,427 INFO L226 Difference]: Without dead ends: 584 [2025-03-03 16:24:14,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 16:24:14,433 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 482 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:14,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1612 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-03 16:24:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 577. [2025-03-03 16:24:14,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 500 states have (on average 1.492) internal successors, (746), 506 states have internal predecessors, (746), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2025-03-03 16:24:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 855 transitions. [2025-03-03 16:24:14,504 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 855 transitions. Word has length 65 [2025-03-03 16:24:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:14,505 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 855 transitions. [2025-03-03 16:24:14,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 855 transitions. [2025-03-03 16:24:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:14,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:14,507 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] [2025-03-03 16:24:14,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:24:14,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:14,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -660838768, now seen corresponding path program 1 times [2025-03-03 16:24:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:14,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228798020] [2025-03-03 16:24:14,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:14,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:14,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:14,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:14,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:14,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:14,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228798020] [2025-03-03 16:24:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228798020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:14,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:14,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199130400] [2025-03-03 16:24:14,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:14,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:14,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:14,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:14,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:14,705 INFO L87 Difference]: Start difference. First operand 577 states and 855 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:15,469 INFO L93 Difference]: Finished difference Result 950 states and 1376 transitions. [2025-03-03 16:24:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:15,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:24:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:15,476 INFO L225 Difference]: With dead ends: 950 [2025-03-03 16:24:15,476 INFO L226 Difference]: Without dead ends: 737 [2025-03-03 16:24:15,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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 16:24:15,478 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 996 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:15,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1815 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-03 16:24:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 691. [2025-03-03 16:24:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 592 states have (on average 1.4763513513513513) internal successors, (874), 600 states have internal predecessors, (874), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2025-03-03 16:24:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1017 transitions. [2025-03-03 16:24:15,540 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1017 transitions. Word has length 65 [2025-03-03 16:24:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:15,541 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1017 transitions. [2025-03-03 16:24:15,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1017 transitions. [2025-03-03 16:24:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:15,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:15,544 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] [2025-03-03 16:24:15,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:24:15,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:15,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash 472351825, now seen corresponding path program 1 times [2025-03-03 16:24:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358148870] [2025-03-03 16:24:15,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:15,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:15,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:15,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:15,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:15,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:15,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358148870] [2025-03-03 16:24:15,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358148870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:15,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:15,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:24:15,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124415219] [2025-03-03 16:24:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:15,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:24:15,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:15,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:24:15,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:24:15,658 INFO L87 Difference]: Start difference. First operand 691 states and 1017 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:24:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:16,770 INFO L93 Difference]: Finished difference Result 2153 states and 3081 transitions. [2025-03-03 16:24:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2025-03-03 16:24:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:16,780 INFO L225 Difference]: With dead ends: 2153 [2025-03-03 16:24:16,781 INFO L226 Difference]: Without dead ends: 1814 [2025-03-03 16:24:16,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:24:16,783 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 3135 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3153 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:16,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3153 Valid, 2042 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2025-03-03 16:24:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1761. [2025-03-03 16:24:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1457 states have (on average 1.3967055593685656) internal successors, (2035), 1480 states have internal predecessors, (2035), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2025-03-03 16:24:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2421 transitions. [2025-03-03 16:24:16,876 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2421 transitions. Word has length 65 [2025-03-03 16:24:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:16,876 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2421 transitions. [2025-03-03 16:24:16,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:24:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2421 transitions. [2025-03-03 16:24:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:24:16,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:16,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] [2025-03-03 16:24:16,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:24:16,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1753758572, now seen corresponding path program 1 times [2025-03-03 16:24:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:16,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125712896] [2025-03-03 16:24:16,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:16,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:16,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:24:16,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:24:16,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:16,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:16,955 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 16:24:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125712896] [2025-03-03 16:24:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125712896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:16,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:16,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:16,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526180820] [2025-03-03 16:24:16,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:16,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:16,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:16,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:16,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:16,957 INFO L87 Difference]: Start difference. First operand 1761 states and 2421 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:17,045 INFO L93 Difference]: Finished difference Result 3204 states and 4369 transitions. [2025-03-03 16:24:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 16:24:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:17,052 INFO L225 Difference]: With dead ends: 3204 [2025-03-03 16:24:17,053 INFO L226 Difference]: Without dead ends: 1801 [2025-03-03 16:24:17,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:17,055 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 0 mSDsluCounter, 2762 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3454 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:17,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3454 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-03-03 16:24:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2025-03-03 16:24:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1489 states have (on average 1.384150436534587) internal successors, (2061), 1512 states have internal predecessors, (2061), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2025-03-03 16:24:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2455 transitions. [2025-03-03 16:24:17,138 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2455 transitions. Word has length 66 [2025-03-03 16:24:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:17,139 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2455 transitions. [2025-03-03 16:24:17,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2455 transitions. [2025-03-03 16:24:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:24:17,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:17,140 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] [2025-03-03 16:24:17,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:24:17,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:17,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash -908404725, now seen corresponding path program 1 times [2025-03-03 16:24:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263554557] [2025-03-03 16:24:17,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:17,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:24:17,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:24:17,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:17,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:17,236 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 16:24:17,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263554557] [2025-03-03 16:24:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263554557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:24:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213365926] [2025-03-03 16:24:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:17,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:24:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:17,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:24:17,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:24:17,238 INFO L87 Difference]: Start difference. First operand 1801 states and 2455 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:24:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:18,335 INFO L93 Difference]: Finished difference Result 5237 states and 7089 transitions. [2025-03-03 16:24:18,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:18,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2025-03-03 16:24:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:18,349 INFO L225 Difference]: With dead ends: 5237 [2025-03-03 16:24:18,350 INFO L226 Difference]: Without dead ends: 2067 [2025-03-03 16:24:18,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:24:18,360 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 3216 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3234 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:18,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3234 Valid, 2071 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-03-03 16:24:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1997. [2025-03-03 16:24:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1613 states have (on average 1.346559206447613) internal successors, (2172), 1638 states have internal predecessors, (2172), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2025-03-03 16:24:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2652 transitions. [2025-03-03 16:24:18,479 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2652 transitions. Word has length 66 [2025-03-03 16:24:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:18,480 INFO L471 AbstractCegarLoop]: Abstraction has 1997 states and 2652 transitions. [2025-03-03 16:24:18,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:24:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2652 transitions. [2025-03-03 16:24:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:18,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:18,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:18,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:24:18,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1890285234, now seen corresponding path program 1 times [2025-03-03 16:24:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293846989] [2025-03-03 16:24:18,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:18,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:18,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:18,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:18,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293846989] [2025-03-03 16:24:18,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293846989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:18,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:18,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:18,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090065001] [2025-03-03 16:24:18,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:18,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:18,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:18,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:18,568 INFO L87 Difference]: Start difference. First operand 1997 states and 2652 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:18,681 INFO L93 Difference]: Finished difference Result 3696 states and 4863 transitions. [2025-03-03 16:24:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2025-03-03 16:24:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:18,693 INFO L225 Difference]: With dead ends: 3696 [2025-03-03 16:24:18,693 INFO L226 Difference]: Without dead ends: 2057 [2025-03-03 16:24:18,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:18,699 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 0 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3405 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:18,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3405 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2025-03-03 16:24:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2057. [2025-03-03 16:24:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 1661 states have (on average 1.3329319686935581) internal successors, (2214), 1686 states have internal predecessors, (2214), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2025-03-03 16:24:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2706 transitions. [2025-03-03 16:24:18,785 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2706 transitions. Word has length 92 [2025-03-03 16:24:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:18,785 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 2706 transitions. [2025-03-03 16:24:18,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:24:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2706 transitions. [2025-03-03 16:24:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:18,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:18,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:18,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:24:18,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1452275731, now seen corresponding path program 1 times [2025-03-03 16:24:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900523347] [2025-03-03 16:24:18,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:18,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:18,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:18,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:18,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900523347] [2025-03-03 16:24:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900523347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:18,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:18,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697663052] [2025-03-03 16:24:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:18,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:18,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:18,950 INFO L87 Difference]: Start difference. First operand 2057 states and 2706 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:19,665 INFO L93 Difference]: Finished difference Result 3505 states and 4545 transitions. [2025-03-03 16:24:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:24:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2025-03-03 16:24:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:19,675 INFO L225 Difference]: With dead ends: 3505 [2025-03-03 16:24:19,676 INFO L226 Difference]: Without dead ends: 2045 [2025-03-03 16:24:19,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:19,679 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 995 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:19,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1553 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2025-03-03 16:24:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1835. [2025-03-03 16:24:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1492 states have (on average 1.3371313672922251) internal successors, (1995), 1512 states have internal predecessors, (1995), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2025-03-03 16:24:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2419 transitions. [2025-03-03 16:24:19,758 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2419 transitions. Word has length 92 [2025-03-03 16:24:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:19,758 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2419 transitions. [2025-03-03 16:24:19,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2419 transitions. [2025-03-03 16:24:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:19,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:19,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:19,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:24:19,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:19,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1460035090, now seen corresponding path program 1 times [2025-03-03 16:24:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208571385] [2025-03-03 16:24:19,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:19,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:19,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:19,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:19,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:24:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208571385] [2025-03-03 16:24:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208571385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:19,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:19,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:24:19,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965075818] [2025-03-03 16:24:19,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:19,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:24:19,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:19,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:24:19,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:24:19,813 INFO L87 Difference]: Start difference. First operand 1835 states and 2419 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:20,310 INFO L93 Difference]: Finished difference Result 4787 states and 6249 transitions. [2025-03-03 16:24:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:24:20,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2025-03-03 16:24:20,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:20,325 INFO L225 Difference]: With dead ends: 4787 [2025-03-03 16:24:20,325 INFO L226 Difference]: Without dead ends: 3311 [2025-03-03 16:24:20,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:20,329 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 922 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:20,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 787 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:24:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2025-03-03 16:24:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 3311. [2025-03-03 16:24:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 2648 states have (on average 1.2953172205438066) internal successors, (3430), 2697 states have internal predecessors, (3430), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2025-03-03 16:24:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4298 transitions. [2025-03-03 16:24:20,502 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4298 transitions. Word has length 92 [2025-03-03 16:24:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:20,503 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 4298 transitions. [2025-03-03 16:24:20,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4298 transitions. [2025-03-03 16:24:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:20,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:20,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:20,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:24:20,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -676656115, now seen corresponding path program 1 times [2025-03-03 16:24:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474861497] [2025-03-03 16:24:20,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:20,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:20,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:20,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:20,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:20,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474861497] [2025-03-03 16:24:20,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474861497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:20,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:20,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:24:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765788870] [2025-03-03 16:24:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:20,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:20,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:20,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:20,532 INFO L87 Difference]: Start difference. First operand 3311 states and 4298 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:20,607 INFO L93 Difference]: Finished difference Result 4787 states and 6129 transitions. [2025-03-03 16:24:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:20,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2025-03-03 16:24:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:20,616 INFO L225 Difference]: With dead ends: 4787 [2025-03-03 16:24:20,617 INFO L226 Difference]: Without dead ends: 1835 [2025-03-03 16:24:20,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:20,623 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 141 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:20,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1216 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-03 16:24:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2025-03-03 16:24:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1492 states have (on average 1.3123324396782843) internal successors, (1958), 1512 states have internal predecessors, (1958), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2025-03-03 16:24:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2382 transitions. [2025-03-03 16:24:20,697 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2382 transitions. Word has length 92 [2025-03-03 16:24:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:20,697 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2382 transitions. [2025-03-03 16:24:20,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:24:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2382 transitions. [2025-03-03 16:24:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:24:20,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:20,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:20,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:24:20,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:20,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:20,699 INFO L85 PathProgramCache]: Analyzing trace with hash 463341909, now seen corresponding path program 1 times [2025-03-03 16:24:20,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:20,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494397579] [2025-03-03 16:24:20,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:20,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:24:20,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:24:20,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:20,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:24:20,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494397579] [2025-03-03 16:24:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494397579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:20,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:20,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:24:20,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600662100] [2025-03-03 16:24:20,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:20,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:24:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:20,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:24:20,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:24:20,812 INFO L87 Difference]: Start difference. First operand 1835 states and 2382 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:24:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:21,869 INFO L93 Difference]: Finished difference Result 4184 states and 5363 transitions. [2025-03-03 16:24:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2025-03-03 16:24:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:21,879 INFO L225 Difference]: With dead ends: 4184 [2025-03-03 16:24:21,879 INFO L226 Difference]: Without dead ends: 2557 [2025-03-03 16:24:21,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:24:21,882 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 1614 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:21,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 2135 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2025-03-03 16:24:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2436. [2025-03-03 16:24:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1947 states have (on average 1.2773497688751927) internal successors, (2487), 1976 states have internal predecessors, (2487), 259 states have call successors, (259), 170 states have call predecessors, (259), 228 states have return successors, (341), 291 states have call predecessors, (341), 257 states have call successors, (341) [2025-03-03 16:24:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3087 transitions. [2025-03-03 16:24:21,972 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3087 transitions. Word has length 93 [2025-03-03 16:24:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:21,972 INFO L471 AbstractCegarLoop]: Abstraction has 2436 states and 3087 transitions. [2025-03-03 16:24:21,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:24:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3087 transitions. [2025-03-03 16:24:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:24:21,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:21,974 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:24:21,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:24:21,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:21,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash -518112679, now seen corresponding path program 1 times [2025-03-03 16:24:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:21,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136379908] [2025-03-03 16:24:21,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:21,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:21,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:24:21,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:24:21,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:21,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 16:24:22,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136379908] [2025-03-03 16:24:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136379908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:24:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277423613] [2025-03-03 16:24:22,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:22,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:24:22,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:24:22,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:24:22,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:24:22,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:24:22,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:24:22,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:22,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:22,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:24:22,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:24:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 16:24:22,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:24:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277423613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:22,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:24:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 16:24:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619207644] [2025-03-03 16:24:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:22,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:22,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:22,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:22,365 INFO L87 Difference]: Start difference. First operand 2436 states and 3087 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:24:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:22,614 INFO L93 Difference]: Finished difference Result 6365 states and 7884 transitions. [2025-03-03 16:24:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:22,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-03 16:24:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:22,652 INFO L225 Difference]: With dead ends: 6365 [2025-03-03 16:24:22,652 INFO L226 Difference]: Without dead ends: 4365 [2025-03-03 16:24:22,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:22,658 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 61 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:22,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1344 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2025-03-03 16:24:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 4333. [2025-03-03 16:24:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 3427 states have (on average 1.245404143565801) internal successors, (4268), 3481 states have internal predecessors, (4268), 466 states have call successors, (466), 333 states have call predecessors, (466), 438 states have return successors, (604), 520 states have call predecessors, (604), 464 states have call successors, (604) [2025-03-03 16:24:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 5338 transitions. [2025-03-03 16:24:22,976 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 5338 transitions. Word has length 164 [2025-03-03 16:24:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:22,977 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 5338 transitions. [2025-03-03 16:24:22,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:24:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 5338 transitions. [2025-03-03 16:24:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:22,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:22,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:22,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:24:23,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 16:24:23,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:23,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash -26138718, now seen corresponding path program 1 times [2025-03-03 16:24:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170706747] [2025-03-03 16:24:23,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:23,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:23,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:23,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:23,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:23,224 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 16:24:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170706747] [2025-03-03 16:24:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170706747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:23,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:24:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450080113] [2025-03-03 16:24:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:23,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:23,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:23,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:23,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:23,225 INFO L87 Difference]: Start difference. First operand 4333 states and 5338 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:23,353 INFO L93 Difference]: Finished difference Result 4675 states and 5863 transitions. [2025-03-03 16:24:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 16:24:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:23,377 INFO L225 Difference]: With dead ends: 4675 [2025-03-03 16:24:23,380 INFO L226 Difference]: Without dead ends: 4333 [2025-03-03 16:24:23,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:23,384 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 528 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:23,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 825 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2025-03-03 16:24:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 4333. [2025-03-03 16:24:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 3427 states have (on average 1.2451123431572804) internal successors, (4267), 3481 states have internal predecessors, (4267), 466 states have call successors, (466), 333 states have call predecessors, (466), 438 states have return successors, (604), 520 states have call predecessors, (604), 464 states have call successors, (604) [2025-03-03 16:24:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 5337 transitions. [2025-03-03 16:24:23,597 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 5337 transitions. Word has length 156 [2025-03-03 16:24:23,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:23,597 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 5337 transitions. [2025-03-03 16:24:23,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 5337 transitions. [2025-03-03 16:24:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:23,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:23,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:23,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:24:23,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:23,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:23,600 INFO L85 PathProgramCache]: Analyzing trace with hash -991701535, now seen corresponding path program 1 times [2025-03-03 16:24:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:23,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782791813] [2025-03-03 16:24:23,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:23,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:23,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:23,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:23,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:23,640 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 16:24:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:23,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782791813] [2025-03-03 16:24:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782791813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:23,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:23,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:24:23,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866737153] [2025-03-03 16:24:23,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:23,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:23,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:23,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:23,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:23,642 INFO L87 Difference]: Start difference. First operand 4333 states and 5337 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:23,792 INFO L93 Difference]: Finished difference Result 4667 states and 5846 transitions. [2025-03-03 16:24:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:23,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2025-03-03 16:24:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:23,809 INFO L225 Difference]: With dead ends: 4667 [2025-03-03 16:24:23,809 INFO L226 Difference]: Without dead ends: 4333 [2025-03-03 16:24:23,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:23,813 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 519 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:23,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 824 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2025-03-03 16:24:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 4333. [2025-03-03 16:24:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 3427 states have (on average 1.2448205427487598) internal successors, (4266), 3481 states have internal predecessors, (4266), 466 states have call successors, (466), 333 states have call predecessors, (466), 438 states have return successors, (604), 520 states have call predecessors, (604), 464 states have call successors, (604) [2025-03-03 16:24:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 5336 transitions. [2025-03-03 16:24:24,100 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 5336 transitions. Word has length 156 [2025-03-03 16:24:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:24,100 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 5336 transitions. [2025-03-03 16:24:24,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 5336 transitions. [2025-03-03 16:24:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:24,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:24,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:24,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:24:24,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash -97766624, now seen corresponding path program 1 times [2025-03-03 16:24:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405898795] [2025-03-03 16:24:24,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:24,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:24,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:24,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:24,222 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 16:24:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:24,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405898795] [2025-03-03 16:24:24,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405898795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:24,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:24,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145924584] [2025-03-03 16:24:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:24,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:24,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:24,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:24,224 INFO L87 Difference]: Start difference. First operand 4333 states and 5336 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 16:24:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:24,902 INFO L93 Difference]: Finished difference Result 5035 states and 6426 transitions. [2025-03-03 16:24:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:24,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:24,920 INFO L225 Difference]: With dead ends: 5035 [2025-03-03 16:24:24,920 INFO L226 Difference]: Without dead ends: 4704 [2025-03-03 16:24:24,923 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 16:24:24,924 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 1186 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:24,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1689 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:24:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2025-03-03 16:24:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 4679. [2025-03-03 16:24:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4679 states, 3747 states have (on average 1.270883373365359) internal successors, (4762), 3802 states have internal predecessors, (4762), 485 states have call successors, (485), 339 states have call predecessors, (485), 445 states have return successors, (624), 539 states have call predecessors, (624), 483 states have call successors, (624) [2025-03-03 16:24:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4679 states to 4679 states and 5871 transitions. [2025-03-03 16:24:25,127 INFO L78 Accepts]: Start accepts. Automaton has 4679 states and 5871 transitions. Word has length 156 [2025-03-03 16:24:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:25,128 INFO L471 AbstractCegarLoop]: Abstraction has 4679 states and 5871 transitions. [2025-03-03 16:24:25,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 16:24:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4679 states and 5871 transitions. [2025-03-03 16:24:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:25,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:25,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:25,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:24:25,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:25,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 813533538, now seen corresponding path program 1 times [2025-03-03 16:24:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:25,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625976276] [2025-03-03 16:24:25,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:25,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:25,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:25,251 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 16:24:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625976276] [2025-03-03 16:24:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625976276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:25,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:25,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132282209] [2025-03-03 16:24:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:25,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:25,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:25,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:25,253 INFO L87 Difference]: Start difference. First operand 4679 states and 5871 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:26,140 INFO L93 Difference]: Finished difference Result 5792 states and 7617 transitions. [2025-03-03 16:24:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:26,154 INFO L225 Difference]: With dead ends: 5792 [2025-03-03 16:24:26,154 INFO L226 Difference]: Without dead ends: 5115 [2025-03-03 16:24:26,156 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 16:24:26,156 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 1192 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:26,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 3162 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2025-03-03 16:24:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 5002. [2025-03-03 16:24:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5002 states, 4044 states have (on average 1.2888229475766568) internal successors, (5212), 4100 states have internal predecessors, (5212), 504 states have call successors, (504), 345 states have call predecessors, (504), 452 states have return successors, (646), 559 states have call predecessors, (646), 502 states have call successors, (646) [2025-03-03 16:24:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 6362 transitions. [2025-03-03 16:24:26,385 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 6362 transitions. Word has length 156 [2025-03-03 16:24:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:26,386 INFO L471 AbstractCegarLoop]: Abstraction has 5002 states and 6362 transitions. [2025-03-03 16:24:26,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 6362 transitions. [2025-03-03 16:24:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:26,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:26,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:26,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:24:26,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:26,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2142670335, now seen corresponding path program 1 times [2025-03-03 16:24:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:26,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323310795] [2025-03-03 16:24:26,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:26,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:26,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:26,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:26,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:26,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:26,496 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 16:24:26,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:26,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323310795] [2025-03-03 16:24:26,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323310795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:26,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:26,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:26,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820069186] [2025-03-03 16:24:26,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:26,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:26,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:26,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:26,498 INFO L87 Difference]: Start difference. First operand 5002 states and 6362 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:27,390 INFO L93 Difference]: Finished difference Result 6819 states and 9205 transitions. [2025-03-03 16:24:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:27,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:27,411 INFO L225 Difference]: With dead ends: 6819 [2025-03-03 16:24:27,411 INFO L226 Difference]: Without dead ends: 5819 [2025-03-03 16:24:27,416 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 16:24:27,417 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 1187 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:27,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 3146 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2025-03-03 16:24:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 5689. [2025-03-03 16:24:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5689 states, 4677 states have (on average 1.3228565319649348) internal successors, (6187), 4737 states have internal predecessors, (6187), 542 states have call successors, (542), 357 states have call predecessors, (542), 468 states have return successors, (696), 599 states have call predecessors, (696), 540 states have call successors, (696) [2025-03-03 16:24:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 7425 transitions. [2025-03-03 16:24:27,810 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 7425 transitions. Word has length 156 [2025-03-03 16:24:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:27,810 INFO L471 AbstractCegarLoop]: Abstraction has 5689 states and 7425 transitions. [2025-03-03 16:24:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 7425 transitions. [2025-03-03 16:24:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:27,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:27,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:24:27,813 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:27,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1960937086, now seen corresponding path program 1 times [2025-03-03 16:24:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859685560] [2025-03-03 16:24:27,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:27,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:27,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:27,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:27,926 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 16:24:27,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:27,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859685560] [2025-03-03 16:24:27,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859685560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:27,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488207753] [2025-03-03 16:24:27,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:27,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:27,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:27,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:27,929 INFO L87 Difference]: Start difference. First operand 5689 states and 7425 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:28,863 INFO L93 Difference]: Finished difference Result 9032 states and 12702 transitions. [2025-03-03 16:24:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:28,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:28,885 INFO L225 Difference]: With dead ends: 9032 [2025-03-03 16:24:28,885 INFO L226 Difference]: Without dead ends: 7345 [2025-03-03 16:24:28,891 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 16:24:28,892 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1182 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:28,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 3134 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2025-03-03 16:24:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 7180. [2025-03-03 16:24:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7180 states, 6054 states have (on average 1.3794185662371985) internal successors, (8351), 6128 states have internal predecessors, (8351), 618 states have call successors, (618), 381 states have call predecessors, (618), 506 states have return successors, (820), 679 states have call predecessors, (820), 616 states have call successors, (820) [2025-03-03 16:24:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7180 states to 7180 states and 9789 transitions. [2025-03-03 16:24:29,224 INFO L78 Accepts]: Start accepts. Automaton has 7180 states and 9789 transitions. Word has length 156 [2025-03-03 16:24:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:29,224 INFO L471 AbstractCegarLoop]: Abstraction has 7180 states and 9789 transitions. [2025-03-03 16:24:29,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7180 states and 9789 transitions. [2025-03-03 16:24:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:29,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:29,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:29,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:24:29,228 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:29,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1816527391, now seen corresponding path program 1 times [2025-03-03 16:24:29,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:29,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466959601] [2025-03-03 16:24:29,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:29,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:29,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:29,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:29,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:29,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:29,332 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 16:24:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466959601] [2025-03-03 16:24:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466959601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:29,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:29,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042502004] [2025-03-03 16:24:29,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:29,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:29,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:29,334 INFO L87 Difference]: Start difference. First operand 7180 states and 9789 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:30,342 INFO L93 Difference]: Finished difference Result 13907 states and 20636 transitions. [2025-03-03 16:24:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:30,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:30,372 INFO L225 Difference]: With dead ends: 13907 [2025-03-03 16:24:30,373 INFO L226 Difference]: Without dead ends: 10729 [2025-03-03 16:24:30,381 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 16:24:30,382 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 1177 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:30,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 3122 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2025-03-03 16:24:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 10495. [2025-03-03 16:24:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 9123 states have (on average 1.4564288063137125) internal successors, (13287), 9243 states have internal predecessors, (13287), 770 states have call successors, (770), 429 states have call predecessors, (770), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 15221 transitions. [2025-03-03 16:24:30,917 INFO L78 Accepts]: Start accepts. Automaton has 10495 states and 15221 transitions. Word has length 156 [2025-03-03 16:24:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:30,918 INFO L471 AbstractCegarLoop]: Abstraction has 10495 states and 15221 transitions. [2025-03-03 16:24:30,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10495 states and 15221 transitions. [2025-03-03 16:24:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:30,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:30,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:24:30,923 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2088963678, now seen corresponding path program 1 times [2025-03-03 16:24:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409898007] [2025-03-03 16:24:30,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:30,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:30,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:30,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:30,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:31,072 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 16:24:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:31,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409898007] [2025-03-03 16:24:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409898007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:31,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:31,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084729280] [2025-03-03 16:24:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:31,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:31,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:31,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:31,073 INFO L87 Difference]: Start difference. First operand 10495 states and 15221 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:31,906 INFO L93 Difference]: Finished difference Result 18482 states and 28641 transitions. [2025-03-03 16:24:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:31,934 INFO L225 Difference]: With dead ends: 18482 [2025-03-03 16:24:31,934 INFO L226 Difference]: Without dead ends: 11989 [2025-03-03 16:24:31,944 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 16:24:31,945 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 896 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:31,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1259 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:24:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11989 states. [2025-03-03 16:24:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11989 to 10495. [2025-03-03 16:24:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 9123 states have (on average 1.454565384193796) internal successors, (13270), 9243 states have internal predecessors, (13270), 770 states have call successors, (770), 429 states have call predecessors, (770), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 15204 transitions. [2025-03-03 16:24:32,367 INFO L78 Accepts]: Start accepts. Automaton has 10495 states and 15204 transitions. Word has length 156 [2025-03-03 16:24:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:32,367 INFO L471 AbstractCegarLoop]: Abstraction has 10495 states and 15204 transitions. [2025-03-03 16:24:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10495 states and 15204 transitions. [2025-03-03 16:24:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:32,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:32,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:32,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:24:32,372 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:32,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:32,373 INFO L85 PathProgramCache]: Analyzing trace with hash 396100033, now seen corresponding path program 1 times [2025-03-03 16:24:32,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:32,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738440077] [2025-03-03 16:24:32,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:32,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:32,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:32,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:32,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:32,453 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 16:24:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738440077] [2025-03-03 16:24:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738440077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:32,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:32,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822790148] [2025-03-03 16:24:32,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:32,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:32,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:32,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:32,455 INFO L87 Difference]: Start difference. First operand 10495 states and 15204 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:33,234 INFO L93 Difference]: Finished difference Result 18399 states and 28441 transitions. [2025-03-03 16:24:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:33,271 INFO L225 Difference]: With dead ends: 18399 [2025-03-03 16:24:33,271 INFO L226 Difference]: Without dead ends: 11906 [2025-03-03 16:24:33,288 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 16:24:33,289 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 893 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:33,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1251 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:24:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2025-03-03 16:24:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 10495. [2025-03-03 16:24:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 9123 states have (on average 1.4527019620738792) internal successors, (13253), 9243 states have internal predecessors, (13253), 770 states have call successors, (770), 429 states have call predecessors, (770), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 15187 transitions. [2025-03-03 16:24:33,836 INFO L78 Accepts]: Start accepts. Automaton has 10495 states and 15187 transitions. Word has length 156 [2025-03-03 16:24:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:33,837 INFO L471 AbstractCegarLoop]: Abstraction has 10495 states and 15187 transitions. [2025-03-03 16:24:33,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 10495 states and 15187 transitions. [2025-03-03 16:24:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:33,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:33,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:24:33,843 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:33,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash -77925950, now seen corresponding path program 1 times [2025-03-03 16:24:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719869093] [2025-03-03 16:24:33,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:33,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:33,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:33,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:33,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719869093] [2025-03-03 16:24:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719869093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422473407] [2025-03-03 16:24:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:33,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:33,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:33,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:33,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:33,935 INFO L87 Difference]: Start difference. First operand 10495 states and 15187 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:34,943 INFO L93 Difference]: Finished difference Result 18316 states and 28241 transitions. [2025-03-03 16:24:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:34,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:34,984 INFO L225 Difference]: With dead ends: 18316 [2025-03-03 16:24:34,984 INFO L226 Difference]: Without dead ends: 11823 [2025-03-03 16:24:34,999 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 16:24:35,000 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 890 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:35,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1243 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2025-03-03 16:24:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 10495. [2025-03-03 16:24:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 9123 states have (on average 1.4508385399539625) internal successors, (13236), 9243 states have internal predecessors, (13236), 770 states have call successors, (770), 429 states have call predecessors, (770), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 15170 transitions. [2025-03-03 16:24:35,885 INFO L78 Accepts]: Start accepts. Automaton has 10495 states and 15170 transitions. Word has length 156 [2025-03-03 16:24:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:35,885 INFO L471 AbstractCegarLoop]: Abstraction has 10495 states and 15170 transitions. [2025-03-03 16:24:35,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 10495 states and 15170 transitions. [2025-03-03 16:24:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:35,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:35,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:35,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:24:35,891 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -370311775, now seen corresponding path program 1 times [2025-03-03 16:24:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086557815] [2025-03-03 16:24:35,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:35,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:35,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:35,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:36,019 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 16:24:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086557815] [2025-03-03 16:24:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086557815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:36,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:36,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015171467] [2025-03-03 16:24:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:36,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:36,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:36,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:36,021 INFO L87 Difference]: Start difference. First operand 10495 states and 15170 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:37,354 INFO L93 Difference]: Finished difference Result 24630 states and 38549 transitions. [2025-03-03 16:24:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:37,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:37,409 INFO L225 Difference]: With dead ends: 24630 [2025-03-03 16:24:37,409 INFO L226 Difference]: Without dead ends: 18137 [2025-03-03 16:24:37,426 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 16:24:37,427 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 1148 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:37,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 3053 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18137 states. [2025-03-03 16:24:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18137 to 17827. [2025-03-03 16:24:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17827 states, 15909 states have (on average 1.527060154629455) internal successors, (24294), 16175 states have internal predecessors, (24294), 1074 states have call successors, (1074), 525 states have call predecessors, (1074), 842 states have return successors, (2236), 1159 states have call predecessors, (2236), 1072 states have call successors, (2236) [2025-03-03 16:24:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17827 states to 17827 states and 27604 transitions. [2025-03-03 16:24:38,275 INFO L78 Accepts]: Start accepts. Automaton has 17827 states and 27604 transitions. Word has length 156 [2025-03-03 16:24:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:38,276 INFO L471 AbstractCegarLoop]: Abstraction has 17827 states and 27604 transitions. [2025-03-03 16:24:38,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 17827 states and 27604 transitions. [2025-03-03 16:24:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:38,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:38,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:38,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:24:38,282 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:38,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1559919074, now seen corresponding path program 1 times [2025-03-03 16:24:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677966765] [2025-03-03 16:24:38,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:38,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:38,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:38,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:38,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:38,355 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 16:24:38,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:38,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677966765] [2025-03-03 16:24:38,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677966765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:38,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108109915] [2025-03-03 16:24:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:38,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:38,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:38,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:38,357 INFO L87 Difference]: Start difference. First operand 17827 states and 27604 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:39,364 INFO L93 Difference]: Finished difference Result 35082 states and 57593 transitions. [2025-03-03 16:24:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:39,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:39,432 INFO L225 Difference]: With dead ends: 35082 [2025-03-03 16:24:39,432 INFO L226 Difference]: Without dead ends: 21257 [2025-03-03 16:24:39,467 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 16:24:39,468 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 886 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:39,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1229 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21257 states. [2025-03-03 16:24:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21257 to 17827. [2025-03-03 16:24:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17827 states, 15909 states have (on average 1.5249858570620403) internal successors, (24261), 16175 states have internal predecessors, (24261), 1074 states have call successors, (1074), 525 states have call predecessors, (1074), 842 states have return successors, (2236), 1159 states have call predecessors, (2236), 1072 states have call successors, (2236) [2025-03-03 16:24:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17827 states to 17827 states and 27571 transitions. [2025-03-03 16:24:40,356 INFO L78 Accepts]: Start accepts. Automaton has 17827 states and 27571 transitions. Word has length 156 [2025-03-03 16:24:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:40,357 INFO L471 AbstractCegarLoop]: Abstraction has 17827 states and 27571 transitions. [2025-03-03 16:24:40,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 17827 states and 27571 transitions. [2025-03-03 16:24:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:40,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:40,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:40,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:24:40,364 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:40,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1345089921, now seen corresponding path program 1 times [2025-03-03 16:24:40,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:40,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670983155] [2025-03-03 16:24:40,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:40,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:40,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:40,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:40,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:40,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670983155] [2025-03-03 16:24:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670983155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790709649] [2025-03-03 16:24:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:40,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:40,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:40,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:40,448 INFO L87 Difference]: Start difference. First operand 17827 states and 27571 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:42,022 INFO L93 Difference]: Finished difference Result 48740 states and 81014 transitions. [2025-03-03 16:24:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:42,136 INFO L225 Difference]: With dead ends: 48740 [2025-03-03 16:24:42,136 INFO L226 Difference]: Without dead ends: 34915 [2025-03-03 16:24:42,179 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 16:24:42,180 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1135 mSDsluCounter, 2272 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:42,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 3022 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:24:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34915 states. [2025-03-03 16:24:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34915 to 34435. [2025-03-03 16:24:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34435 states, 31263 states have (on average 1.5907302562134151) internal successors, (49731), 31983 states have internal predecessors, (49731), 1682 states have call successors, (1682), 717 states have call predecessors, (1682), 1488 states have return successors, (5916), 1799 states have call predecessors, (5916), 1680 states have call successors, (5916) [2025-03-03 16:24:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34435 states to 34435 states and 57329 transitions. [2025-03-03 16:24:44,220 INFO L78 Accepts]: Start accepts. Automaton has 34435 states and 57329 transitions. Word has length 156 [2025-03-03 16:24:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:44,220 INFO L471 AbstractCegarLoop]: Abstraction has 34435 states and 57329 transitions. [2025-03-03 16:24:44,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 34435 states and 57329 transitions. [2025-03-03 16:24:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:44,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:44,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:44,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:24:44,229 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:44,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1155692030, now seen corresponding path program 1 times [2025-03-03 16:24:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99092987] [2025-03-03 16:24:44,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:44,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:44,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:44,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:44,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:44,309 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 16:24:44,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:44,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99092987] [2025-03-03 16:24:44,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99092987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:44,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696011865] [2025-03-03 16:24:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:44,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:44,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:44,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:44,311 INFO L87 Difference]: Start difference. First operand 34435 states and 57329 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:47,170 INFO L93 Difference]: Finished difference Result 109302 states and 194179 transitions. [2025-03-03 16:24:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:47,461 INFO L225 Difference]: With dead ends: 109302 [2025-03-03 16:24:47,461 INFO L226 Difference]: Without dead ends: 78869 [2025-03-03 16:24:47,557 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 16:24:47,558 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 1444 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:47,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 2997 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78869 states. [2025-03-03 16:24:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78869 to 73048. [2025-03-03 16:24:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73048 states, 66946 states have (on average 1.6465658889254025) internal successors, (110231), 69060 states have internal predecessors, (110231), 2834 states have call successors, (2834), 1101 states have call predecessors, (2834), 3266 states have return successors, (19356), 3015 states have call predecessors, (19356), 2832 states have call successors, (19356) [2025-03-03 16:24:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73048 states to 73048 states and 132421 transitions. [2025-03-03 16:24:51,437 INFO L78 Accepts]: Start accepts. Automaton has 73048 states and 132421 transitions. Word has length 156 [2025-03-03 16:24:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:51,437 INFO L471 AbstractCegarLoop]: Abstraction has 73048 states and 132421 transitions. [2025-03-03 16:24:51,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 73048 states and 132421 transitions. [2025-03-03 16:24:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 16:24:51,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:51,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:51,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:24:51,453 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:51,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash -682173087, now seen corresponding path program 1 times [2025-03-03 16:24:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553340438] [2025-03-03 16:24:51,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:51,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 16:24:51,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 16:24:51,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:51,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:51,527 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 16:24:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553340438] [2025-03-03 16:24:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553340438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:51,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776244385] [2025-03-03 16:24:51,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:51,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:51,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:51,529 INFO L87 Difference]: Start difference. First operand 73048 states and 132421 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 16:24:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:58,118 INFO L93 Difference]: Finished difference Result 244863 states and 477373 transitions. [2025-03-03 16:24:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:58,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 156 [2025-03-03 16:24:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:58,989 INFO L225 Difference]: With dead ends: 244863 [2025-03-03 16:24:58,989 INFO L226 Difference]: Without dead ends: 175817 [2025-03-03 16:24:59,301 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 16:24:59,302 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1408 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:59,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 2981 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175817 states.