./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:56:31,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:56:31,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:56:31,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:56:31,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:56:31,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:56:31,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:56:31,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:56:31,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:56:31,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:56:31,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:56:31,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:56:31,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:56:31,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:56:31,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:56:31,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:56:31,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:56:31,169 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-jdk21/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 -> 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f [2025-02-05 17:56:31,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:56:31,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:56:31,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:56:31,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:56:31,511 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:56:31,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-02-05 17:56:32,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02bce00b/6cf4b6d6399b4b2faeace02a133cf82b/FLAGbbbb063f3 [2025-02-05 17:56:32,968 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:56:32,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-02-05 17:56:32,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02bce00b/6cf4b6d6399b4b2faeace02a133cf82b/FLAGbbbb063f3 [2025-02-05 17:56:32,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d02bce00b/6cf4b6d6399b4b2faeace02a133cf82b [2025-02-05 17:56:32,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:56:32,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:56:32,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:56:32,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:56:32,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:56:33,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:56:32" (1/1) ... [2025-02-05 17:56:33,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a486dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33, skipping insertion in model container [2025-02-05 17:56:33,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:56:32" (1/1) ... [2025-02-05 17:56:33,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:56:33,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2025-02-05 17:56:33,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2025-02-05 17:56:33,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:56:33,239 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:56:33,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2025-02-05 17:56:33,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2025-02-05 17:56:33,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:56:33,293 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:56:33,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33 WrapperNode [2025-02-05 17:56:33,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:56:33,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:56:33,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:56:33,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:56:33,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,327 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 707 [2025-02-05 17:56:33,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:56:33,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:56:33,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:56:33,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:56:33,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,353 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-02-05 17:56:33,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:56:33,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:56:33,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:56:33,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:56:33,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (1/1) ... [2025-02-05 17:56:33,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:56:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:56:33,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:56:33,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:56:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:56:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:56:33,411 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:56:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:56:33,411 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:56:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:56:33,412 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:56:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:56:33,412 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:56:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:56:33,412 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:56:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:56:33,412 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:56:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:56:33,412 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:56:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:56:33,412 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:56:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:56:33,412 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:56:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:56:33,413 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:56:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:56:33,413 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:56:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:56:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:56:33,413 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:56:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:56:33,413 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:56:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:56:33,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:56:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:56:33,413 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:56:33,541 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:56:33,548 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:56:34,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-02-05 17:56:34,009 INFO L1309 $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-02-05 17:56:34,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-02-05 17:56:34,112 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-02-05 17:56:34,112 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:56:34,122 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:56:34,123 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:56:34,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:56:34 BoogieIcfgContainer [2025-02-05 17:56:34,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:56:34,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:56:34,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:56:34,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:56:34,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:56:32" (1/3) ... [2025-02-05 17:56:34,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735df548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:56:34, skipping insertion in model container [2025-02-05 17:56:34,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:56:33" (2/3) ... [2025-02-05 17:56:34,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735df548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:56:34, skipping insertion in model container [2025-02-05 17:56:34,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:56:34" (3/3) ... [2025-02-05 17:56:34,129 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-02-05 17:56:34,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:56:34,139 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.06.cil-2.c that has 15 procedures, 365 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-02-05 17:56:34,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:56:34,192 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;@6cec625c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:56:34,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:56:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 366 states, 312 states have (on average 1.5320512820512822) internal successors, (478), 319 states have internal predecessors, (478), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-05 17:56:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:56:34,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:34,203 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-02-05 17:56:34,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:34,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1448088744, now seen corresponding path program 1 times [2025-02-05 17:56:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940620967] [2025-02-05 17:56:34,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:34,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:56:34,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:56:34,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:34,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940620967] [2025-02-05 17:56:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940620967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:56:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833649152] [2025-02-05 17:56:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:34,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:56:34,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:34,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:56:34,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:56:34,579 INFO L87 Difference]: Start difference. First operand has 366 states, 312 states have (on average 1.5320512820512822) internal successors, (478), 319 states have internal predecessors, (478), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) 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-02-05 17:56:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:35,168 INFO L93 Difference]: Finished difference Result 832 states and 1249 transitions. [2025-02-05 17:56:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:56:35,170 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-02-05 17:56:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:35,178 INFO L225 Difference]: With dead ends: 832 [2025-02-05 17:56:35,178 INFO L226 Difference]: Without dead ends: 476 [2025-02-05 17:56:35,181 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-02-05 17:56:35,182 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 402 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:35,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1186 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:56:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-05 17:56:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 469. [2025-02-05 17:56:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 396 states have (on average 1.4646464646464648) internal successors, (580), 402 states have internal predecessors, (580), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2025-02-05 17:56:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 681 transitions. [2025-02-05 17:56:35,231 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 681 transitions. Word has length 65 [2025-02-05 17:56:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:35,231 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 681 transitions. [2025-02-05 17:56:35,231 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-02-05 17:56:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 681 transitions. [2025-02-05 17:56:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:56:35,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:35,234 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-02-05 17:56:35,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:56:35,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:35,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 140049416, now seen corresponding path program 1 times [2025-02-05 17:56:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:35,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374624991] [2025-02-05 17:56:35,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:35,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:56:35,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:56:35,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374624991] [2025-02-05 17:56:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374624991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:35,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:35,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:35,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436087930] [2025-02-05 17:56:35,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:35,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:35,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:35,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:35,389 INFO L87 Difference]: Start difference. First operand 469 states and 681 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-02-05 17:56:36,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:36,039 INFO L93 Difference]: Finished difference Result 842 states and 1199 transitions. [2025-02-05 17:56:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:36,039 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-02-05 17:56:36,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:36,043 INFO L225 Difference]: With dead ends: 842 [2025-02-05 17:56:36,043 INFO L226 Difference]: Without dead ends: 629 [2025-02-05 17:56:36,044 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-02-05 17:56:36,045 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 747 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:36,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1466 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:56:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-02-05 17:56:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 583. [2025-02-05 17:56:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 488 states have (on average 1.4487704918032787) internal successors, (707), 496 states have internal predecessors, (707), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2025-02-05 17:56:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 842 transitions. [2025-02-05 17:56:36,086 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 842 transitions. Word has length 65 [2025-02-05 17:56:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:36,086 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 842 transitions. [2025-02-05 17:56:36,087 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-02-05 17:56:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 842 transitions. [2025-02-05 17:56:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:56:36,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:36,089 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-02-05 17:56:36,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:56:36,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:36,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:36,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1273240009, now seen corresponding path program 1 times [2025-02-05 17:56:36,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:36,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402151633] [2025-02-05 17:56:36,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:36,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:36,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:56:36,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:56:36,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:36,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402151633] [2025-02-05 17:56:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402151633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:36,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:36,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:56:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370687795] [2025-02-05 17:56:36,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:36,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:56:36,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:36,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:56:36,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:56:36,162 INFO L87 Difference]: Start difference. First operand 583 states and 842 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:56:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:36,344 INFO L93 Difference]: Finished difference Result 1495 states and 2127 transitions. [2025-02-05 17:56:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:56:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-02-05 17:56:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:36,350 INFO L225 Difference]: With dead ends: 1495 [2025-02-05 17:56:36,350 INFO L226 Difference]: Without dead ends: 1174 [2025-02-05 17:56:36,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:56:36,352 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 618 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:36,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1212 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:56:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-05 17:56:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1157. [2025-02-05 17:56:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 952 states have (on average 1.406512605042017) internal successors, (1339), 968 states have internal predecessors, (1339), 122 states have call successors, (122), 70 states have call predecessors, (122), 81 states have return successors, (158), 122 states have call predecessors, (158), 120 states have call successors, (158) [2025-02-05 17:56:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2025-02-05 17:56:36,423 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 65 [2025-02-05 17:56:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:36,423 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2025-02-05 17:56:36,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:56:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2025-02-05 17:56:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:56:36,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:36,426 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-02-05 17:56:36,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:56:36,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -348581136, now seen corresponding path program 1 times [2025-02-05 17:56:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315772766] [2025-02-05 17:56:36,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:36,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:56:36,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:56:36,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:36,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:36,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315772766] [2025-02-05 17:56:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315772766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:36,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:36,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:36,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617897435] [2025-02-05 17:56:36,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:36,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:36,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:36,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:36,512 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 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-02-05 17:56:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:36,589 INFO L93 Difference]: Finished difference Result 2072 states and 2892 transitions. [2025-02-05 17:56:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:56:36,590 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-02-05 17:56:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:36,595 INFO L225 Difference]: With dead ends: 2072 [2025-02-05 17:56:36,595 INFO L226 Difference]: Without dead ends: 1177 [2025-02-05 17:56:36,597 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-02-05 17:56:36,598 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 0 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2589 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-02-05 17:56:36,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2589 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:56:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-02-05 17:56:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2025-02-05 17:56:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 968 states have (on average 1.3946280991735538) internal successors, (1350), 984 states have internal predecessors, (1350), 122 states have call successors, (122), 70 states have call predecessors, (122), 85 states have return successors, (165), 126 states have call predecessors, (165), 120 states have call successors, (165) [2025-02-05 17:56:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1637 transitions. [2025-02-05 17:56:36,687 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1637 transitions. Word has length 66 [2025-02-05 17:56:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:36,688 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1637 transitions. [2025-02-05 17:56:36,688 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-02-05 17:56:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1637 transitions. [2025-02-05 17:56:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:56:36,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:36,689 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-02-05 17:56:36,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:56:36,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:36,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1284222863, now seen corresponding path program 1 times [2025-02-05 17:56:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:36,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486373160] [2025-02-05 17:56:36,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:36,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:56:36,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:56:36,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:36,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:36,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486373160] [2025-02-05 17:56:36,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486373160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:36,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:36,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:36,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475145729] [2025-02-05 17:56:36,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:36,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:36,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:36,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:36,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:36,792 INFO L87 Difference]: Start difference. First operand 1177 states and 1637 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:56:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:37,326 INFO L93 Difference]: Finished difference Result 3747 states and 5173 transitions. [2025-02-05 17:56:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:56:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2025-02-05 17:56:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:37,335 INFO L225 Difference]: With dead ends: 3747 [2025-02-05 17:56:37,336 INFO L226 Difference]: Without dead ends: 1449 [2025-02-05 17:56:37,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:56:37,344 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1531 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:37,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 2297 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-02-05 17:56:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1084. [2025-02-05 17:56:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 875 states have (on average 1.3691428571428572) internal successors, (1198), 891 states have internal predecessors, (1198), 122 states have call successors, (122), 70 states have call predecessors, (122), 85 states have return successors, (153), 126 states have call predecessors, (153), 120 states have call successors, (153) [2025-02-05 17:56:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1473 transitions. [2025-02-05 17:56:37,427 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1473 transitions. Word has length 66 [2025-02-05 17:56:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:37,427 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1473 transitions. [2025-02-05 17:56:37,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:56:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1473 transitions. [2025-02-05 17:56:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:56:37,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:37,430 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] [2025-02-05 17:56:37,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:56:37,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash -871041062, now seen corresponding path program 1 times [2025-02-05 17:56:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:37,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84486576] [2025-02-05 17:56:37,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:37,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:56:37,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:56:37,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:37,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:37,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:37,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84486576] [2025-02-05 17:56:37,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84486576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:37,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:37,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:56:37,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435662266] [2025-02-05 17:56:37,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:37,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:56:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:37,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:56:37,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:56:37,584 INFO L87 Difference]: Start difference. First operand 1084 states and 1473 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:56:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:38,259 INFO L93 Difference]: Finished difference Result 2195 states and 2947 transitions. [2025-02-05 17:56:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:56:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2025-02-05 17:56:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:38,263 INFO L225 Difference]: With dead ends: 2195 [2025-02-05 17:56:38,263 INFO L226 Difference]: Without dead ends: 242 [2025-02-05 17:56:38,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:56:38,267 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 884 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:38,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1374 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:56:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-05 17:56:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-02-05 17:56:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.5069767441860464) internal successors, (324), 216 states have internal predecessors, (324), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 17:56:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 364 transitions. [2025-02-05 17:56:38,280 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 364 transitions. Word has length 67 [2025-02-05 17:56:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:38,280 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 364 transitions. [2025-02-05 17:56:38,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:56:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 364 transitions. [2025-02-05 17:56:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:38,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:38,283 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] [2025-02-05 17:56:38,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:56:38,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:38,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1995847001, now seen corresponding path program 1 times [2025-02-05 17:56:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221750429] [2025-02-05 17:56:38,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:38,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:38,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:38,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:38,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:38,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221750429] [2025-02-05 17:56:38,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221750429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:38,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:38,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:56:38,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641196121] [2025-02-05 17:56:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:38,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:56:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:38,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:56:38,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:56:38,324 INFO L87 Difference]: Start difference. First operand 242 states and 364 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-05 17:56:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:38,337 INFO L93 Difference]: Finished difference Result 474 states and 713 transitions. [2025-02-05 17:56:38,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:56:38,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:38,339 INFO L225 Difference]: With dead ends: 474 [2025-02-05 17:56:38,339 INFO L226 Difference]: Without dead ends: 242 [2025-02-05 17:56:38,339 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-02-05 17:56:38,340 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 354 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 363 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-02-05 17:56:38,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 363 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:56:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-05 17:56:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-02-05 17:56:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.5023255813953489) internal successors, (323), 216 states have internal predecessors, (323), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 17:56:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 363 transitions. [2025-02-05 17:56:38,351 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 363 transitions. Word has length 112 [2025-02-05 17:56:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:38,352 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 363 transitions. [2025-02-05 17:56:38,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-05 17:56:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 363 transitions. [2025-02-05 17:56:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:38,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:38,352 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] [2025-02-05 17:56:38,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:56:38,353 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:38,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 501934552, now seen corresponding path program 1 times [2025-02-05 17:56:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:38,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521785197] [2025-02-05 17:56:38,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:38,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:38,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:38,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:38,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:38,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:38,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521785197] [2025-02-05 17:56:38,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521785197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:38,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:38,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:56:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387568073] [2025-02-05 17:56:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:56:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:38,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:56:38,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:56:38,434 INFO L87 Difference]: Start difference. First operand 242 states and 363 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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-02-05 17:56:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:38,844 INFO L93 Difference]: Finished difference Result 720 states and 1093 transitions. [2025-02-05 17:56:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:56:38,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:38,848 INFO L225 Difference]: With dead ends: 720 [2025-02-05 17:56:38,848 INFO L226 Difference]: Without dead ends: 493 [2025-02-05 17:56:38,849 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-02-05 17:56:38,849 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 655 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:38,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1002 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:38,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-05 17:56:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 476. [2025-02-05 17:56:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 427 states have (on average 1.515222482435597) internal successors, (647), 429 states have internal predecessors, (647), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-02-05 17:56:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 718 transitions. [2025-02-05 17:56:38,866 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 718 transitions. Word has length 112 [2025-02-05 17:56:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 718 transitions. [2025-02-05 17:56:38,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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-02-05 17:56:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 718 transitions. [2025-02-05 17:56:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:38,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:38,869 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] [2025-02-05 17:56:38,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:56:38,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:38,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1006049766, now seen corresponding path program 1 times [2025-02-05 17:56:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491867209] [2025-02-05 17:56:38,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:38,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:38,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:38,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:38,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491867209] [2025-02-05 17:56:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491867209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:38,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:38,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:38,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854625743] [2025-02-05 17:56:38,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:38,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:38,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:38,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:38,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:38,975 INFO L87 Difference]: Start difference. First operand 476 states and 718 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:39,428 INFO L93 Difference]: Finished difference Result 1229 states and 1876 transitions. [2025-02-05 17:56:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:39,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:39,432 INFO L225 Difference]: With dead ends: 1229 [2025-02-05 17:56:39,432 INFO L226 Difference]: Without dead ends: 768 [2025-02-05 17:56:39,433 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-02-05 17:56:39,433 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 653 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:39,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1924 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-05 17:56:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 695. [2025-02-05 17:56:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 624 states have (on average 1.5080128205128205) internal successors, (941), 627 states have internal predecessors, (941), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-02-05 17:56:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1045 transitions. [2025-02-05 17:56:39,454 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1045 transitions. Word has length 112 [2025-02-05 17:56:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:39,454 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1045 transitions. [2025-02-05 17:56:39,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1045 transitions. [2025-02-05 17:56:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:39,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:39,457 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] [2025-02-05 17:56:39,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:56:39,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:39,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1815537223, now seen corresponding path program 1 times [2025-02-05 17:56:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557191425] [2025-02-05 17:56:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:39,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:39,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:39,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557191425] [2025-02-05 17:56:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557191425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:39,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686508067] [2025-02-05 17:56:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:39,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:39,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:39,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:39,554 INFO L87 Difference]: Start difference. First operand 695 states and 1045 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:39,992 INFO L93 Difference]: Finished difference Result 1920 states and 2924 transitions. [2025-02-05 17:56:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:39,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:39,998 INFO L225 Difference]: With dead ends: 1920 [2025-02-05 17:56:39,998 INFO L226 Difference]: Without dead ends: 1240 [2025-02-05 17:56:39,999 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-02-05 17:56:40,000 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 648 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:40,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1908 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-02-05 17:56:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1158. [2025-02-05 17:56:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1041 states have (on average 1.5100864553314122) internal successors, (1572), 1048 states have internal predecessors, (1572), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-02-05 17:56:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1748 transitions. [2025-02-05 17:56:40,044 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1748 transitions. Word has length 112 [2025-02-05 17:56:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:40,044 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1748 transitions. [2025-02-05 17:56:40,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1748 transitions. [2025-02-05 17:56:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:40,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:40,047 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] [2025-02-05 17:56:40,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:56:40,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:40,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2037675578, now seen corresponding path program 1 times [2025-02-05 17:56:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128424671] [2025-02-05 17:56:40,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:40,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:40,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:40,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:40,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128424671] [2025-02-05 17:56:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128424671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:40,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:40,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:56:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226543835] [2025-02-05 17:56:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:40,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:56:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:40,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:56:40,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:56:40,140 INFO L87 Difference]: Start difference. First operand 1158 states and 1748 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:40,412 INFO L93 Difference]: Finished difference Result 2433 states and 3732 transitions. [2025-02-05 17:56:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:56:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:40,418 INFO L225 Difference]: With dead ends: 2433 [2025-02-05 17:56:40,418 INFO L226 Difference]: Without dead ends: 1290 [2025-02-05 17:56:40,421 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-02-05 17:56:40,421 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 471 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:40,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 712 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:56:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-02-05 17:56:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1158. [2025-02-05 17:56:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1041 states have (on average 1.505283381364073) internal successors, (1567), 1048 states have internal predecessors, (1567), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-02-05 17:56:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1743 transitions. [2025-02-05 17:56:40,488 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1743 transitions. Word has length 112 [2025-02-05 17:56:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:40,489 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1743 transitions. [2025-02-05 17:56:40,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1743 transitions. [2025-02-05 17:56:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:40,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:40,490 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] [2025-02-05 17:56:40,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:56:40,491 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:40,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2023425433, now seen corresponding path program 1 times [2025-02-05 17:56:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:40,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409008918] [2025-02-05 17:56:40,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:40,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:40,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:40,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:40,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:40,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:40,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409008918] [2025-02-05 17:56:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409008918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:40,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:40,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339419317] [2025-02-05 17:56:40,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:40,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:40,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:40,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:40,595 INFO L87 Difference]: Start difference. First operand 1158 states and 1743 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:41,064 INFO L93 Difference]: Finished difference Result 3381 states and 5166 transitions. [2025-02-05 17:56:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:41,074 INFO L225 Difference]: With dead ends: 3381 [2025-02-05 17:56:41,074 INFO L226 Difference]: Without dead ends: 2238 [2025-02-05 17:56:41,077 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-02-05 17:56:41,077 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 635 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:41,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1877 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2025-02-05 17:56:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2144. [2025-02-05 17:56:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1929 states have (on average 1.516329704510109) internal successors, (2925), 1950 states have internal predecessors, (2925), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-02-05 17:56:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3269 transitions. [2025-02-05 17:56:41,210 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3269 transitions. Word has length 112 [2025-02-05 17:56:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:41,211 INFO L471 AbstractCegarLoop]: Abstraction has 2144 states and 3269 transitions. [2025-02-05 17:56:41,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3269 transitions. [2025-02-05 17:56:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:41,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:41,213 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] [2025-02-05 17:56:41,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:56:41,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1053134426, now seen corresponding path program 1 times [2025-02-05 17:56:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829877105] [2025-02-05 17:56:41,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:41,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:41,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:41,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:41,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:41,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829877105] [2025-02-05 17:56:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829877105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:41,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:41,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940959434] [2025-02-05 17:56:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:41,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:41,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:41,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:41,299 INFO L87 Difference]: Start difference. First operand 2144 states and 3269 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:41,825 INFO L93 Difference]: Finished difference Result 6543 states and 10190 transitions. [2025-02-05 17:56:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:41,842 INFO L225 Difference]: With dead ends: 6543 [2025-02-05 17:56:41,843 INFO L226 Difference]: Without dead ends: 4414 [2025-02-05 17:56:41,848 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-02-05 17:56:41,849 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 630 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:41,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1865 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2025-02-05 17:56:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4287. [2025-02-05 17:56:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 3858 states have (on average 1.535769828926905) internal successors, (5925), 3925 states have internal predecessors, (5925), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-02-05 17:56:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6701 transitions. [2025-02-05 17:56:42,060 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6701 transitions. Word has length 112 [2025-02-05 17:56:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 4287 states and 6701 transitions. [2025-02-05 17:56:42,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6701 transitions. [2025-02-05 17:56:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:42,064 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] [2025-02-05 17:56:42,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:56:42,064 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:42,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1991666041, now seen corresponding path program 1 times [2025-02-05 17:56:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373265654] [2025-02-05 17:56:42,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:42,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:42,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:42,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:42,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373265654] [2025-02-05 17:56:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373265654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:42,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477687540] [2025-02-05 17:56:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:42,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:42,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:42,144 INFO L87 Difference]: Start difference. First operand 4287 states and 6701 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:42,838 INFO L93 Difference]: Finished difference Result 13492 states and 21740 transitions. [2025-02-05 17:56:42,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:42,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:42,942 INFO L225 Difference]: With dead ends: 13492 [2025-02-05 17:56:42,942 INFO L226 Difference]: Without dead ends: 9220 [2025-02-05 17:56:42,952 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-02-05 17:56:42,952 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 625 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:42,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1853 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2025-02-05 17:56:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 9032. [2025-02-05 17:56:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9032 states, 8121 states have (on average 1.5605221031892624) internal successors, (12673), 8334 states have internal predecessors, (12673), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-02-05 17:56:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9032 states to 9032 states and 14697 transitions. [2025-02-05 17:56:43,446 INFO L78 Accepts]: Start accepts. Automaton has 9032 states and 14697 transitions. Word has length 112 [2025-02-05 17:56:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:43,448 INFO L471 AbstractCegarLoop]: Abstraction has 9032 states and 14697 transitions. [2025-02-05 17:56:43,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9032 states and 14697 transitions. [2025-02-05 17:56:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:43,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:43,452 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] [2025-02-05 17:56:43,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:56:43,453 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:43,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1606299258, now seen corresponding path program 1 times [2025-02-05 17:56:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:43,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758195507] [2025-02-05 17:56:43,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:43,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:43,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:43,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758195507] [2025-02-05 17:56:43,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758195507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:43,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:43,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816774949] [2025-02-05 17:56:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:43,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:43,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:43,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:43,620 INFO L87 Difference]: Start difference. First operand 9032 states and 14697 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:44,604 INFO L93 Difference]: Finished difference Result 30555 states and 51683 transitions. [2025-02-05 17:56:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:44,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:44,678 INFO L225 Difference]: With dead ends: 30555 [2025-02-05 17:56:44,679 INFO L226 Difference]: Without dead ends: 21538 [2025-02-05 17:56:44,703 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-02-05 17:56:44,704 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 814 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:44,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1828 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21538 states. [2025-02-05 17:56:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21538 to 19641. [2025-02-05 17:56:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19641 states, 17636 states have (on average 1.5895327738716263) internal successors, (28033), 18303 states have internal predecessors, (28033), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-02-05 17:56:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19641 states to 19641 states and 34025 transitions. [2025-02-05 17:56:45,870 INFO L78 Accepts]: Start accepts. Automaton has 19641 states and 34025 transitions. Word has length 112 [2025-02-05 17:56:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:45,870 INFO L471 AbstractCegarLoop]: Abstraction has 19641 states and 34025 transitions. [2025-02-05 17:56:45,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 19641 states and 34025 transitions. [2025-02-05 17:56:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:45,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:45,881 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] [2025-02-05 17:56:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:56:45,882 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:45,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1038531239, now seen corresponding path program 1 times [2025-02-05 17:56:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492912967] [2025-02-05 17:56:45,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:45,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:45,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:45,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:45,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:46,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:46,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492912967] [2025-02-05 17:56:46,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492912967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:46,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:46,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:46,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169480816] [2025-02-05 17:56:46,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:46,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:46,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:46,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:46,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:46,019 INFO L87 Difference]: Start difference. First operand 19641 states and 34025 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:47,899 INFO L93 Difference]: Finished difference Result 66722 states and 122553 transitions. [2025-02-05 17:56:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:47,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:48,090 INFO L225 Difference]: With dead ends: 66722 [2025-02-05 17:56:48,091 INFO L226 Difference]: Without dead ends: 47096 [2025-02-05 17:56:48,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:56:48,145 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 778 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:48,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1812 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47096 states. [2025-02-05 17:56:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47096 to 43538. [2025-02-05 17:56:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43538 states, 38891 states have (on average 1.618395001414209) internal successors, (62941), 40952 states have internal predecessors, (62941), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-02-05 17:56:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43538 states to 43538 states and 82949 transitions. [2025-02-05 17:56:51,013 INFO L78 Accepts]: Start accepts. Automaton has 43538 states and 82949 transitions. Word has length 112 [2025-02-05 17:56:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:56:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 43538 states and 82949 transitions. [2025-02-05 17:56:51,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 43538 states and 82949 transitions. [2025-02-05 17:56:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:56:51,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:56:51,029 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] [2025-02-05 17:56:51,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:56:51,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:56:51,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:56:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash 815814298, now seen corresponding path program 1 times [2025-02-05 17:56:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:56:51,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142578948] [2025-02-05 17:56:51,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:56:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:56:51,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:56:51,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:56:51,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:56:51,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:56:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:56:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:56:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142578948] [2025-02-05 17:56:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142578948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:56:51,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:56:51,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:56:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811142927] [2025-02-05 17:56:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:56:51,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:56:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:56:51,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:56:51,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:56:51,118 INFO L87 Difference]: Start difference. First operand 43538 states and 82949 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:56:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:56:56,006 INFO L93 Difference]: Finished difference Result 148477 states and 308727 transitions. [2025-02-05 17:56:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:56:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2025-02-05 17:56:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:56:56,548 INFO L225 Difference]: With dead ends: 148477 [2025-02-05 17:56:56,549 INFO L226 Difference]: Without dead ends: 104954 [2025-02-05 17:56:56,710 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-02-05 17:56:56,711 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 744 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:56:56,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1804 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:56:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104954 states. [2025-02-05 17:57:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104954 to 99543. [2025-02-05 17:57:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99543 states, 88218 states have (on average 1.6414450565644199) internal successors, (144805), 94525 states have internal predecessors, (144805), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-02-05 17:57:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99543 states to 99543 states and 217293 transitions. [2025-02-05 17:57:04,327 INFO L78 Accepts]: Start accepts. Automaton has 99543 states and 217293 transitions. Word has length 112 [2025-02-05 17:57:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:04,327 INFO L471 AbstractCegarLoop]: Abstraction has 99543 states and 217293 transitions. [2025-02-05 17:57:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 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-02-05 17:57:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 99543 states and 217293 transitions. [2025-02-05 17:57:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:57:04,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:04,357 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] [2025-02-05 17:57:04,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:57:04,358 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:04,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:04,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1984010553, now seen corresponding path program 1 times [2025-02-05 17:57:04,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874272723] [2025-02-05 17:57:04,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:04,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:57:04,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:57:04,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:04,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874272723] [2025-02-05 17:57:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874272723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:04,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:04,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:04,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604552017] [2025-02-05 17:57:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:04,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:04,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:04,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:04,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:04,428 INFO L87 Difference]: Start difference. First operand 99543 states and 217293 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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)