./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:35:02,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:35:02,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:35:02,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:35:02,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:35:02,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:35:02,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:35:02,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:35:02,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:35:02,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:35:02,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:35:02,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:35:02,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:35:02,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:35:02,404 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:35:02,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:35:02,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:35:02,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:35:02,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:35:02,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:35:02,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:35:02,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:02,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:35:02,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c [2025-03-08 07:35:02,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:35:02,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:35:02,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:35:02,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:35:02,627 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:35:02,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c [2025-03-08 07:35:03,803 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb61d5704/ffecc5ae63b546a5b1abc28b8a3e04cf/FLAGdfb0790fd [2025-03-08 07:35:04,077 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:35:04,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c [2025-03-08 07:35:04,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb61d5704/ffecc5ae63b546a5b1abc28b8a3e04cf/FLAGdfb0790fd [2025-03-08 07:35:04,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb61d5704/ffecc5ae63b546a5b1abc28b8a3e04cf [2025-03-08 07:35:04,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:35:04,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:35:04,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:04,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:35:04,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:35:04,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313424c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04, skipping insertion in model container [2025-03-08 07:35:04,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:35:04,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[911,924] [2025-03-08 07:35:04,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[8416,8429] [2025-03-08 07:35:04,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:04,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:35:04,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[911,924] [2025-03-08 07:35:04,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c[8416,8429] [2025-03-08 07:35:04,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:04,460 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:35:04,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04 WrapperNode [2025-03-08 07:35:04,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:04,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:04,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:35:04,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:35:04,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,516 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 593 [2025-03-08 07:35:04,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:04,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:35:04,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:35:04,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:35:04,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,550 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:35:04,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:35:04,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:35:04,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:35:04,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:35:04,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (1/1) ... [2025-03-08 07:35:04,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:04,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:35:04,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:35:04,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:35:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:35:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:35:04,624 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:35:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:35:04,624 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:35:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:35:04,624 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:35:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:35:04,624 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:35:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:35:04,624 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:35:04,624 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:35:04,625 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:35:04,625 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:35:04,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:35:04,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:35:04,626 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:35:04,626 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:35:04,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:35:04,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:35:05,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-08 07:35:05,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-08 07:35:05,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-08 07:35:05,245 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-03-08 07:35:05,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:35:05,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:35:05,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:35:05,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:05 BoogieIcfgContainer [2025-03-08 07:35:05,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:35:05,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:35:05,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:35:05,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:35:05,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:35:04" (1/3) ... [2025-03-08 07:35:05,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c030fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:05, skipping insertion in model container [2025-03-08 07:35:05,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:04" (2/3) ... [2025-03-08 07:35:05,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c030fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:05, skipping insertion in model container [2025-03-08 07:35:05,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:05" (3/3) ... [2025-03-08 07:35:05,270 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.04.cil-1.c [2025-03-08 07:35:05,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:35:05,282 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.04.cil-1.c that has 15 procedures, 293 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-08 07:35:05,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:35:05,373 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;@6016049e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:35:05,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:35:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 244 states have (on average 1.540983606557377) internal successors, (376), 248 states have internal predecessors, (376), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 07:35:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:05,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:05,384 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] [2025-03-08 07:35:05,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:05,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1742388544, now seen corresponding path program 1 times [2025-03-08 07:35:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702444202] [2025-03-08 07:35:05,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:05,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:05,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:05,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:05,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702444202] [2025-03-08 07:35:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702444202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018077352] [2025-03-08 07:35:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:05,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:05,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:05,774 INFO L87 Difference]: Start difference. First operand has 293 states, 244 states have (on average 1.540983606557377) internal successors, (376), 248 states have internal predecessors, (376), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:06,341 INFO L93 Difference]: Finished difference Result 681 states and 1035 transitions. [2025-03-08 07:35:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:06,354 INFO L225 Difference]: With dead ends: 681 [2025-03-08 07:35:06,355 INFO L226 Difference]: Without dead ends: 398 [2025-03-08 07:35:06,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:06,359 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 356 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:06,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 940 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-08 07:35:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 391. [2025-03-08 07:35:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 320 states have (on average 1.4875) internal successors, (476), 326 states have internal predecessors, (476), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2025-03-08 07:35:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 573 transitions. [2025-03-08 07:35:06,424 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 573 transitions. Word has length 63 [2025-03-08 07:35:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:06,424 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 573 transitions. [2025-03-08 07:35:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 573 transitions. [2025-03-08 07:35:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:06,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:06,428 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] [2025-03-08 07:35:06,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:35:06,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:06,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -738164192, now seen corresponding path program 1 times [2025-03-08 07:35:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417426667] [2025-03-08 07:35:06,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:06,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:06,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:06,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:06,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417426667] [2025-03-08 07:35:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417426667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:06,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:06,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:06,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930506216] [2025-03-08 07:35:06,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:06,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:06,600 INFO L87 Difference]: Start difference. First operand 391 states and 573 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:07,207 INFO L93 Difference]: Finished difference Result 746 states and 1076 transitions. [2025-03-08 07:35:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:07,212 INFO L225 Difference]: With dead ends: 746 [2025-03-08 07:35:07,212 INFO L226 Difference]: Without dead ends: 545 [2025-03-08 07:35:07,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:07,214 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 606 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:07,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1203 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-08 07:35:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 499. [2025-03-08 07:35:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 406 states have (on average 1.4729064039408868) internal successors, (598), 414 states have internal predecessors, (598), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2025-03-08 07:35:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 729 transitions. [2025-03-08 07:35:07,263 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 729 transitions. Word has length 63 [2025-03-08 07:35:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:07,264 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 729 transitions. [2025-03-08 07:35:07,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 729 transitions. [2025-03-08 07:35:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:07,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:07,266 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] [2025-03-08 07:35:07,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:35:07,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:07,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:07,267 INFO L85 PathProgramCache]: Analyzing trace with hash -745923551, now seen corresponding path program 1 times [2025-03-08 07:35:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232630546] [2025-03-08 07:35:07,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:07,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:07,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:07,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232630546] [2025-03-08 07:35:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232630546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:07,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169168482] [2025-03-08 07:35:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:07,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:07,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:07,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:07,357 INFO L87 Difference]: Start difference. First operand 499 states and 729 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:08,424 INFO L93 Difference]: Finished difference Result 1875 states and 2707 transitions. [2025-03-08 07:35:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:08,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 63 [2025-03-08 07:35:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:08,433 INFO L225 Difference]: With dead ends: 1875 [2025-03-08 07:35:08,433 INFO L226 Difference]: Without dead ends: 1554 [2025-03-08 07:35:08,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:35:08,439 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 2080 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:08,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 1393 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:35:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-08 07:35:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1507. [2025-03-08 07:35:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1209 states have (on average 1.403639371381307) internal successors, (1697), 1232 states have internal predecessors, (1697), 170 states have call successors, (170), 111 states have call predecessors, (170), 126 states have return successors, (204), 166 states have call predecessors, (204), 168 states have call successors, (204) [2025-03-08 07:35:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2071 transitions. [2025-03-08 07:35:08,555 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2071 transitions. Word has length 63 [2025-03-08 07:35:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:08,555 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 2071 transitions. [2025-03-08 07:35:08,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2071 transitions. [2025-03-08 07:35:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:08,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:08,557 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] [2025-03-08 07:35:08,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:35:08,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash -686247328, now seen corresponding path program 1 times [2025-03-08 07:35:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54437220] [2025-03-08 07:35:08,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:08,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:08,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:08,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:08,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54437220] [2025-03-08 07:35:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54437220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:08,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253377722] [2025-03-08 07:35:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:08,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:08,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:08,653 INFO L87 Difference]: Start difference. First operand 1507 states and 2071 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:08,722 INFO L93 Difference]: Finished difference Result 2870 states and 3939 transitions. [2025-03-08 07:35:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2025-03-08 07:35:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:08,729 INFO L225 Difference]: With dead ends: 2870 [2025-03-08 07:35:08,730 INFO L226 Difference]: Without dead ends: 1547 [2025-03-08 07:35:08,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:08,734 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 0 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:08,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2074 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-03-08 07:35:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2025-03-08 07:35:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1241 states have (on average 1.3883964544721998) internal successors, (1723), 1264 states have internal predecessors, (1723), 170 states have call successors, (170), 111 states have call predecessors, (170), 134 states have return successors, (212), 174 states have call predecessors, (212), 168 states have call successors, (212) [2025-03-08 07:35:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2105 transitions. [2025-03-08 07:35:08,807 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2105 transitions. Word has length 64 [2025-03-08 07:35:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:08,807 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2105 transitions. [2025-03-08 07:35:08,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2105 transitions. [2025-03-08 07:35:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:08,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:08,809 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] [2025-03-08 07:35:08,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:35:08,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1264052927, now seen corresponding path program 1 times [2025-03-08 07:35:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009664683] [2025-03-08 07:35:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:08,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:08,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:08,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:08,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009664683] [2025-03-08 07:35:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009664683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:08,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:08,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321275217] [2025-03-08 07:35:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:08,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:08,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:08,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:08,877 INFO L87 Difference]: Start difference. First operand 1547 states and 2105 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:09,820 INFO L93 Difference]: Finished difference Result 4766 states and 6522 transitions. [2025-03-08 07:35:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:09,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-03-08 07:35:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:09,831 INFO L225 Difference]: With dead ends: 4766 [2025-03-08 07:35:09,831 INFO L226 Difference]: Without dead ends: 1835 [2025-03-08 07:35:09,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:35:09,841 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 2109 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:09,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 1434 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:35:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-08 07:35:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1765. [2025-03-08 07:35:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1387 states have (on average 1.338139870223504) internal successors, (1856), 1412 states have internal predecessors, (1856), 210 states have call successors, (210), 139 states have call predecessors, (210), 166 states have return successors, (258), 216 states have call predecessors, (258), 208 states have call successors, (258) [2025-03-08 07:35:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2324 transitions. [2025-03-08 07:35:09,962 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2324 transitions. Word has length 64 [2025-03-08 07:35:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:09,963 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2324 transitions. [2025-03-08 07:35:09,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:35:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2324 transitions. [2025-03-08 07:35:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:09,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:09,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:35:09,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:09,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:09,966 INFO L85 PathProgramCache]: Analyzing trace with hash 111789351, now seen corresponding path program 1 times [2025-03-08 07:35:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362925589] [2025-03-08 07:35:09,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:09,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:09,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:09,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:09,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:10,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362925589] [2025-03-08 07:35:10,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362925589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:10,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:10,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:10,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152168416] [2025-03-08 07:35:10,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:10,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:10,061 INFO L87 Difference]: Start difference. First operand 1765 states and 2324 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:10,132 INFO L93 Difference]: Finished difference Result 3406 states and 4477 transitions. [2025-03-08 07:35:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:10,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 86 [2025-03-08 07:35:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:10,142 INFO L225 Difference]: With dead ends: 3406 [2025-03-08 07:35:10,142 INFO L226 Difference]: Without dead ends: 1825 [2025-03-08 07:35:10,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:10,147 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 0 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:10,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2035 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-03-08 07:35:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1825. [2025-03-08 07:35:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1435 states have (on average 1.3226480836236933) internal successors, (1898), 1460 states have internal predecessors, (1898), 210 states have call successors, (210), 139 states have call predecessors, (210), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2025-03-08 07:35:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2378 transitions. [2025-03-08 07:35:10,260 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2378 transitions. Word has length 86 [2025-03-08 07:35:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:10,261 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2378 transitions. [2025-03-08 07:35:10,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2378 transitions. [2025-03-08 07:35:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:10,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:10,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:10,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:35:10,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:10,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1081370374, now seen corresponding path program 1 times [2025-03-08 07:35:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:10,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124954887] [2025-03-08 07:35:10,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:10,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:10,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:10,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:10,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:10,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124954887] [2025-03-08 07:35:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124954887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:10,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891441335] [2025-03-08 07:35:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:10,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:10,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:10,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:10,439 INFO L87 Difference]: Start difference. First operand 1825 states and 2378 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:10,982 INFO L93 Difference]: Finished difference Result 3231 states and 4175 transitions. [2025-03-08 07:35:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:35:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 86 [2025-03-08 07:35:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:10,991 INFO L225 Difference]: With dead ends: 3231 [2025-03-08 07:35:10,992 INFO L226 Difference]: Without dead ends: 1821 [2025-03-08 07:35:10,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:35:10,996 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 607 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:10,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 980 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2025-03-08 07:35:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1611. [2025-03-08 07:35:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1274 states have (on average 1.3241758241758241) internal successors, (1687), 1294 states have internal predecessors, (1687), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2025-03-08 07:35:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2099 transitions. [2025-03-08 07:35:11,093 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2099 transitions. Word has length 86 [2025-03-08 07:35:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:11,093 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2099 transitions. [2025-03-08 07:35:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2099 transitions. [2025-03-08 07:35:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:11,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:11,095 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:11,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:35:11,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:11,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 632673735, now seen corresponding path program 1 times [2025-03-08 07:35:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673550099] [2025-03-08 07:35:11,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:11,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:11,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:11,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:11,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:11,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:35:11,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:11,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673550099] [2025-03-08 07:35:11,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673550099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:11,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:35:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003758481] [2025-03-08 07:35:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:11,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:35:11,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:11,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:35:11,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:35:11,166 INFO L87 Difference]: Start difference. First operand 1611 states and 2099 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:35:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:11,548 INFO L93 Difference]: Finished difference Result 4463 states and 5829 transitions. [2025-03-08 07:35:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:35:11,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2025-03-08 07:35:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:11,564 INFO L225 Difference]: With dead ends: 4463 [2025-03-08 07:35:11,564 INFO L226 Difference]: Without dead ends: 3037 [2025-03-08 07:35:11,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:11,568 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 538 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:11,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 493 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3037 states. [2025-03-08 07:35:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3037 to 3037. [2025-03-08 07:35:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 2380 states have (on average 1.2907563025210085) internal successors, (3072), 2429 states have internal predecessors, (3072), 343 states have call successors, (343), 233 states have call predecessors, (343), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2025-03-08 07:35:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 3928 transitions. [2025-03-08 07:35:11,715 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 3928 transitions. Word has length 86 [2025-03-08 07:35:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:11,716 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 3928 transitions. [2025-03-08 07:35:11,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:35:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 3928 transitions. [2025-03-08 07:35:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:11,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:11,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:11,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:35:11,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1741488934, now seen corresponding path program 1 times [2025-03-08 07:35:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812412454] [2025-03-08 07:35:11,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:11,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:11,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:11,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:11,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812412454] [2025-03-08 07:35:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812412454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:11,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:11,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:35:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806264767] [2025-03-08 07:35:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:11,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:35:11,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:11,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:35:11,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:11,751 INFO L87 Difference]: Start difference. First operand 3037 states and 3928 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:11,838 INFO L93 Difference]: Finished difference Result 4463 states and 5709 transitions. [2025-03-08 07:35:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:35:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2025-03-08 07:35:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:11,847 INFO L225 Difference]: With dead ends: 4463 [2025-03-08 07:35:11,848 INFO L226 Difference]: Without dead ends: 1611 [2025-03-08 07:35:11,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:11,854 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 137 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:11,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 672 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-03-08 07:35:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2025-03-08 07:35:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1274 states have (on average 1.2951334379905808) internal successors, (1650), 1294 states have internal predecessors, (1650), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2025-03-08 07:35:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2062 transitions. [2025-03-08 07:35:11,928 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2062 transitions. Word has length 86 [2025-03-08 07:35:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:11,929 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2062 transitions. [2025-03-08 07:35:11,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2062 transitions. [2025-03-08 07:35:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:35:11,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:11,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:11,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:35:11,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:11,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash -586607428, now seen corresponding path program 1 times [2025-03-08 07:35:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:11,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017408644] [2025-03-08 07:35:11,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:11,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:35:11,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:35:11,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:11,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:35:12,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017408644] [2025-03-08 07:35:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017408644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:12,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:12,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:35:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378258291] [2025-03-08 07:35:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:12,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:35:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:12,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:35:12,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:35:12,024 INFO L87 Difference]: Start difference. First operand 1611 states and 2062 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:35:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:12,949 INFO L93 Difference]: Finished difference Result 3896 states and 4979 transitions. [2025-03-08 07:35:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-08 07:35:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:12,960 INFO L225 Difference]: With dead ends: 3896 [2025-03-08 07:35:12,961 INFO L226 Difference]: Without dead ends: 2323 [2025-03-08 07:35:12,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:35:12,966 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1248 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:12,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1324 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:35:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2025-03-08 07:35:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2202. [2025-03-08 07:35:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 1719 states have (on average 1.2617801047120418) internal successors, (2169), 1748 states have internal predecessors, (2169), 253 states have call successors, (253), 170 states have call predecessors, (253), 228 states have return successors, (335), 285 states have call predecessors, (335), 251 states have call successors, (335) [2025-03-08 07:35:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2757 transitions. [2025-03-08 07:35:13,107 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2757 transitions. Word has length 87 [2025-03-08 07:35:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 2757 transitions. [2025-03-08 07:35:13,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:35:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2757 transitions. [2025-03-08 07:35:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:13,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:13,111 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] [2025-03-08 07:35:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:35:13,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -36059032, now seen corresponding path program 1 times [2025-03-08 07:35:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548838727] [2025-03-08 07:35:13,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:13,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:13,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:13,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:13,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:13,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548838727] [2025-03-08 07:35:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548838727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260452106] [2025-03-08 07:35:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:13,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:13,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:13,171 INFO L87 Difference]: Start difference. First operand 2202 states and 2757 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:13,597 INFO L93 Difference]: Finished difference Result 2544 states and 3283 transitions. [2025-03-08 07:35:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:13,607 INFO L225 Difference]: With dead ends: 2544 [2025-03-08 07:35:13,607 INFO L226 Difference]: Without dead ends: 2381 [2025-03-08 07:35:13,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:13,609 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 650 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:13,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 891 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2025-03-08 07:35:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2368. [2025-03-08 07:35:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1865 states have (on average 1.2841823056300268) internal successors, (2395), 1895 states have internal predecessors, (2395), 266 states have call successors, (266), 176 states have call predecessors, (266), 235 states have return successors, (349), 298 states have call predecessors, (349), 264 states have call successors, (349) [2025-03-08 07:35:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3010 transitions. [2025-03-08 07:35:13,727 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3010 transitions. Word has length 88 [2025-03-08 07:35:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:13,727 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3010 transitions. [2025-03-08 07:35:13,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3010 transitions. [2025-03-08 07:35:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:13,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:13,729 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] [2025-03-08 07:35:13,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:35:13,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:13,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash -29966294, now seen corresponding path program 1 times [2025-03-08 07:35:13,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101692615] [2025-03-08 07:35:13,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:13,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:13,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:13,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:13,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101692615] [2025-03-08 07:35:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101692615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:13,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:13,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581586585] [2025-03-08 07:35:13,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:13,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:13,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:13,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:13,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:13,818 INFO L87 Difference]: Start difference. First operand 2368 states and 3010 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:14,380 INFO L93 Difference]: Finished difference Result 2905 states and 3838 transitions. [2025-03-08 07:35:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:14,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:14,391 INFO L225 Difference]: With dead ends: 2905 [2025-03-08 07:35:14,392 INFO L226 Difference]: Without dead ends: 2576 [2025-03-08 07:35:14,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:14,394 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 644 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:14,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1564 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2025-03-08 07:35:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2523. [2025-03-08 07:35:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2000 states have (on average 1.2995) internal successors, (2599), 2031 states have internal predecessors, (2599), 279 states have call successors, (279), 182 states have call predecessors, (279), 242 states have return successors, (365), 312 states have call predecessors, (365), 277 states have call successors, (365) [2025-03-08 07:35:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3243 transitions. [2025-03-08 07:35:14,569 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3243 transitions. Word has length 88 [2025-03-08 07:35:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:14,569 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 3243 transitions. [2025-03-08 07:35:14,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3243 transitions. [2025-03-08 07:35:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:14,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:14,571 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] [2025-03-08 07:35:14,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:35:14,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:14,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2138999543, now seen corresponding path program 1 times [2025-03-08 07:35:14,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:14,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662913695] [2025-03-08 07:35:14,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:14,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:14,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:14,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:14,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:14,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:14,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:14,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662913695] [2025-03-08 07:35:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662913695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:14,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:14,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519598012] [2025-03-08 07:35:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:14,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:14,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:14,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:14,671 INFO L87 Difference]: Start difference. First operand 2523 states and 3243 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:15,252 INFO L93 Difference]: Finished difference Result 3392 states and 4580 transitions. [2025-03-08 07:35:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:15,266 INFO L225 Difference]: With dead ends: 3392 [2025-03-08 07:35:15,267 INFO L226 Difference]: Without dead ends: 2908 [2025-03-08 07:35:15,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:15,268 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 639 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:15,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1548 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2025-03-08 07:35:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2850. [2025-03-08 07:35:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2285 states have (on average 1.3277899343544857) internal successors, (3034), 2320 states have internal predecessors, (3034), 305 states have call successors, (305), 194 states have call predecessors, (305), 258 states have return successors, (403), 340 states have call predecessors, (403), 303 states have call successors, (403) [2025-03-08 07:35:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 3742 transitions. [2025-03-08 07:35:15,489 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 3742 transitions. Word has length 88 [2025-03-08 07:35:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:15,489 INFO L471 AbstractCegarLoop]: Abstraction has 2850 states and 3742 transitions. [2025-03-08 07:35:15,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 3742 transitions. [2025-03-08 07:35:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:15,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:15,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] [2025-03-08 07:35:15,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:35:15,491 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:15,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1672292426, now seen corresponding path program 1 times [2025-03-08 07:35:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491237434] [2025-03-08 07:35:15,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:15,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:15,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:15,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:15,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491237434] [2025-03-08 07:35:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491237434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:15,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088257876] [2025-03-08 07:35:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:15,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:15,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:15,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:15,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:15,577 INFO L87 Difference]: Start difference. First operand 2850 states and 3742 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:16,211 INFO L93 Difference]: Finished difference Result 4429 states and 6193 transitions. [2025-03-08 07:35:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:16,237 INFO L225 Difference]: With dead ends: 4429 [2025-03-08 07:35:16,237 INFO L226 Difference]: Without dead ends: 3618 [2025-03-08 07:35:16,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:16,243 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 634 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:16,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1536 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2025-03-08 07:35:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 3549. [2025-03-08 07:35:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 2894 states have (on average 1.3731859018659296) internal successors, (3974), 2943 states have internal predecessors, (3974), 357 states have call successors, (357), 218 states have call predecessors, (357), 296 states have return successors, (503), 396 states have call predecessors, (503), 355 states have call successors, (503) [2025-03-08 07:35:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4834 transitions. [2025-03-08 07:35:16,410 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4834 transitions. Word has length 88 [2025-03-08 07:35:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:16,410 INFO L471 AbstractCegarLoop]: Abstraction has 3549 states and 4834 transitions. [2025-03-08 07:35:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4834 transitions. [2025-03-08 07:35:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:16,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:16,412 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] [2025-03-08 07:35:16,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:35:16,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:16,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1668445975, now seen corresponding path program 1 times [2025-03-08 07:35:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625062145] [2025-03-08 07:35:16,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:16,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:16,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:16,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:16,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:16,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625062145] [2025-03-08 07:35:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625062145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:16,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660850384] [2025-03-08 07:35:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:16,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:16,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:16,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:16,531 INFO L87 Difference]: Start difference. First operand 3549 states and 4834 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:17,153 INFO L93 Difference]: Finished difference Result 6664 states and 9783 transitions. [2025-03-08 07:35:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:17,180 INFO L225 Difference]: With dead ends: 6664 [2025-03-08 07:35:17,181 INFO L226 Difference]: Without dead ends: 5154 [2025-03-08 07:35:17,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:17,186 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 629 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:17,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1524 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2025-03-08 07:35:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 5064. [2025-03-08 07:35:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5064 states, 4211 states have (on average 1.4319639040607932) internal successors, (6030), 4306 states have internal predecessors, (6030), 461 states have call successors, (461), 266 states have call predecessors, (461), 390 states have return successors, (799), 508 states have call predecessors, (799), 459 states have call successors, (799) [2025-03-08 07:35:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5064 states to 5064 states and 7290 transitions. [2025-03-08 07:35:17,440 INFO L78 Accepts]: Start accepts. Automaton has 5064 states and 7290 transitions. Word has length 88 [2025-03-08 07:35:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:17,440 INFO L471 AbstractCegarLoop]: Abstraction has 5064 states and 7290 transitions. [2025-03-08 07:35:17,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5064 states and 7290 transitions. [2025-03-08 07:35:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:17,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:17,444 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] [2025-03-08 07:35:17,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:35:17,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:17,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1914759062, now seen corresponding path program 1 times [2025-03-08 07:35:17,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:17,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918535808] [2025-03-08 07:35:17,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:17,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:17,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:17,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:17,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:17,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918535808] [2025-03-08 07:35:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918535808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517321874] [2025-03-08 07:35:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:17,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:17,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:17,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:17,526 INFO L87 Difference]: Start difference. First operand 5064 states and 7290 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:18,372 INFO L93 Difference]: Finished difference Result 12071 states and 18818 transitions. [2025-03-08 07:35:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:18,403 INFO L225 Difference]: With dead ends: 12071 [2025-03-08 07:35:18,403 INFO L226 Difference]: Without dead ends: 9046 [2025-03-08 07:35:18,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:18,443 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 758 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:18,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1499 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9046 states. [2025-03-08 07:35:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9046 to 8343. [2025-03-08 07:35:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8343 states, 7056 states have (on average 1.4929138321995465) internal successors, (10534), 7297 states have internal predecessors, (10534), 653 states have call successors, (653), 362 states have call predecessors, (653), 632 states have return successors, (1759), 716 states have call predecessors, (1759), 651 states have call successors, (1759) [2025-03-08 07:35:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8343 states to 8343 states and 12946 transitions. [2025-03-08 07:35:18,854 INFO L78 Accepts]: Start accepts. Automaton has 8343 states and 12946 transitions. Word has length 88 [2025-03-08 07:35:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:18,855 INFO L471 AbstractCegarLoop]: Abstraction has 8343 states and 12946 transitions. [2025-03-08 07:35:18,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8343 states and 12946 transitions. [2025-03-08 07:35:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:18,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:18,860 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] [2025-03-08 07:35:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:35:18,861 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:18,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 709694665, now seen corresponding path program 1 times [2025-03-08 07:35:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534249211] [2025-03-08 07:35:18,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:18,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:18,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:18,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:18,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534249211] [2025-03-08 07:35:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534249211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:18,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:18,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283332759] [2025-03-08 07:35:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:18,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:18,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:18,950 INFO L87 Difference]: Start difference. First operand 8343 states and 12946 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:19,992 INFO L93 Difference]: Finished difference Result 22970 states and 38816 transitions. [2025-03-08 07:35:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:19,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:20,058 INFO L225 Difference]: With dead ends: 22970 [2025-03-08 07:35:20,058 INFO L226 Difference]: Without dead ends: 16666 [2025-03-08 07:35:20,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:20,081 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 722 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:20,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1483 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16666 states. [2025-03-08 07:35:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16666 to 15454. [2025-03-08 07:35:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15454 states, 13153 states have (on average 1.5389644947920627) internal successors, (20242), 13848 states have internal predecessors, (20242), 1021 states have call successors, (1021), 554 states have call predecessors, (1021), 1278 states have return successors, (5199), 1116 states have call predecessors, (5199), 1019 states have call successors, (5199) [2025-03-08 07:35:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15454 states to 15454 states and 26462 transitions. [2025-03-08 07:35:21,094 INFO L78 Accepts]: Start accepts. Automaton has 15454 states and 26462 transitions. Word has length 88 [2025-03-08 07:35:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:21,094 INFO L471 AbstractCegarLoop]: Abstraction has 15454 states and 26462 transitions. [2025-03-08 07:35:21,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15454 states and 26462 transitions. [2025-03-08 07:35:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:21,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:21,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:21,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:35:21,103 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:21,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash 101617802, now seen corresponding path program 1 times [2025-03-08 07:35:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:21,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993118878] [2025-03-08 07:35:21,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:21,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:21,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:21,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993118878] [2025-03-08 07:35:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993118878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:21,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:21,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677865834] [2025-03-08 07:35:21,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:21,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:21,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:21,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:21,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:21,170 INFO L87 Difference]: Start difference. First operand 15454 states and 26462 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:23,125 INFO L93 Difference]: Finished difference Result 46513 states and 88198 transitions. [2025-03-08 07:35:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:23,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:23,266 INFO L225 Difference]: With dead ends: 46513 [2025-03-08 07:35:23,266 INFO L226 Difference]: Without dead ends: 33098 [2025-03-08 07:35:23,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:23,306 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 688 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:23,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1475 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33098 states. [2025-03-08 07:35:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33098 to 31409. [2025-03-08 07:35:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31409 states, 26626 states have (on average 1.56726507924585) internal successors, (41730), 28715 states have internal predecessors, (41730), 1725 states have call successors, (1725), 938 states have call predecessors, (1725), 3056 states have return successors, (18191), 1884 states have call predecessors, (18191), 1723 states have call successors, (18191) [2025-03-08 07:35:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31409 states to 31409 states and 61646 transitions. [2025-03-08 07:35:25,766 INFO L78 Accepts]: Start accepts. Automaton has 31409 states and 61646 transitions. Word has length 88 [2025-03-08 07:35:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:25,767 INFO L471 AbstractCegarLoop]: Abstraction has 31409 states and 61646 transitions. [2025-03-08 07:35:25,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 31409 states and 61646 transitions. [2025-03-08 07:35:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:25,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:25,781 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] [2025-03-08 07:35:25,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:35:25,782 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:25,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1883117737, now seen corresponding path program 1 times [2025-03-08 07:35:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:25,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343160015] [2025-03-08 07:35:25,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:25,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:25,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:25,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:25,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:25,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:25,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:25,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343160015] [2025-03-08 07:35:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343160015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:25,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980076392] [2025-03-08 07:35:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:25,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:25,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:25,856 INFO L87 Difference]: Start difference. First operand 31409 states and 61646 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:29,974 INFO L93 Difference]: Finished difference Result 98468 states and 221876 transitions. [2025-03-08 07:35:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:29,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:30,433 INFO L225 Difference]: With dead ends: 98468 [2025-03-08 07:35:30,434 INFO L226 Difference]: Without dead ends: 69098 [2025-03-08 07:35:30,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:30,591 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 653 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:30,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1463 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69098 states. [2025-03-08 07:35:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69098 to 66772. [2025-03-08 07:35:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66772 states, 55631 states have (on average 1.5716057593787636) internal successors, (87430), 61966 states have internal predecessors, (87430), 3069 states have call successors, (3069), 1706 states have call predecessors, (3069), 8070 states have return successors, (68687), 3356 states have call predecessors, (68687), 3067 states have call successors, (68687) [2025-03-08 07:35:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66772 states to 66772 states and 159186 transitions. [2025-03-08 07:35:35,928 INFO L78 Accepts]: Start accepts. Automaton has 66772 states and 159186 transitions. Word has length 88 [2025-03-08 07:35:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:35,928 INFO L471 AbstractCegarLoop]: Abstraction has 66772 states and 159186 transitions. [2025-03-08 07:35:35,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 66772 states and 159186 transitions. [2025-03-08 07:35:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 07:35:35,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:35,965 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] [2025-03-08 07:35:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:35:35,965 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1107455830, now seen corresponding path program 1 times [2025-03-08 07:35:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597780988] [2025-03-08 07:35:35,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:35,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 07:35:35,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 07:35:35,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597780988] [2025-03-08 07:35:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597780988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:36,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124094169] [2025-03-08 07:35:36,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:36,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:36,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:36,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:36,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:36,059 INFO L87 Difference]: Start difference. First operand 66772 states and 159186 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:44,287 INFO L93 Difference]: Finished difference Result 210907 states and 612394 transitions. [2025-03-08 07:35:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-03-08 07:35:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:45,666 INFO L225 Difference]: With dead ends: 210907 [2025-03-08 07:35:45,666 INFO L226 Difference]: Without dead ends: 146174 [2025-03-08 07:35:45,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:45,960 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 618 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:45,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1451 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146174 states.