./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57a0d461468e871620bb6a0a3de7e8bdfa4741915d12326365887ea97e191d16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:07:44,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:07:44,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:07:44,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:07:44,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:07:44,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:07:44,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:07:44,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:07:44,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:07:44,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:07:44,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:07:44,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:07:44,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:07:44,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:07:44,199 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:07:44,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:07:44,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:07:44,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:07:44,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:07:44,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:07:44,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:44,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:44,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:07:44,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:07:44,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:07:44,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:07:44,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:07:44,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:07:44,203 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57a0d461468e871620bb6a0a3de7e8bdfa4741915d12326365887ea97e191d16 [2025-01-09 06:07:44,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:07:44,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:07:44,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:07:44,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:07:44,494 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:07:44,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c [2025-01-09 06:07:45,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8504805c6/829f4eaa39824366950166d190c86fed/FLAGcb676ffee [2025-01-09 06:07:46,148 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:07:46,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c [2025-01-09 06:07:46,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8504805c6/829f4eaa39824366950166d190c86fed/FLAGcb676ffee [2025-01-09 06:07:46,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8504805c6/829f4eaa39824366950166d190c86fed [2025-01-09 06:07:46,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:07:46,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:07:46,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:07:46,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:07:46,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:07:46,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:46,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ecfb346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46, skipping insertion in model container [2025-01-09 06:07:46,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:46,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:07:46,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[911,924] [2025-01-09 06:07:46,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[8416,8429] [2025-01-09 06:07:46,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:07:46,788 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:07:46,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[911,924] [2025-01-09 06:07:46,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[8416,8429] [2025-01-09 06:07:46,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:07:46,902 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:07:46,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46 WrapperNode [2025-01-09 06:07:46,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:07:46,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:07:46,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:07:46,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:07:46,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:46,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:46,974 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1049 [2025-01-09 06:07:46,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:07:46,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:07:46,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:07:46,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:07:46,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:46,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:46,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,014 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-01-09 06:07:47,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:07:47,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:07:47,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:07:47,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:07:47,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (1/1) ... [2025-01-09 06:07:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:07:47,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:07:47,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:07:47,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:07:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:07:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:07:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:07:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:07:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:07:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:07:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:07:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:07:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:07:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:07:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:07:47,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:07:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:07:47,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:07:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:07:47,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:07:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:07:47,148 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:07:47,262 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:07:47,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:07:48,155 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:07:48,155 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: 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-01-09 06:07:48,389 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-01-09 06:07:48,389 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:07:48,419 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:07:48,420 INFO L312 CfgBuilder]: Removed 19 assume(true) statements. [2025-01-09 06:07:48,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:48 BoogieIcfgContainer [2025-01-09 06:07:48,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:07:48,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:07:48,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:07:48,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:07:48,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:07:46" (1/3) ... [2025-01-09 06:07:48,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f279ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:48, skipping insertion in model container [2025-01-09 06:07:48,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:46" (2/3) ... [2025-01-09 06:07:48,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f279ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:48, skipping insertion in model container [2025-01-09 06:07:48,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:48" (3/3) ... [2025-01-09 06:07:48,430 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.12.cil-2.c [2025-01-09 06:07:48,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:07:48,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.12.cil-2.c that has 15 procedures, 493 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-01-09 06:07:48,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:07:48,525 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;@6e86c8f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:07:48,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:07:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 493 states, 436 states have (on average 1.5963302752293578) internal successors, (696), 440 states have internal predecessors, (696), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 06:07:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:48,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:48,541 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-01-09 06:07:48,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:48,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:48,546 INFO L85 PathProgramCache]: Analyzing trace with hash 501119193, now seen corresponding path program 1 times [2025-01-09 06:07:48,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:48,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912486658] [2025-01-09 06:07:48,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:48,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:48,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:48,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:48,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912486658] [2025-01-09 06:07:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912486658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:48,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:48,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:48,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83958755] [2025-01-09 06:07:48,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:48,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:48,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:48,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:48,921 INFO L87 Difference]: Start difference. First operand has 493 states, 436 states have (on average 1.5963302752293578) internal successors, (696), 440 states have internal predecessors, (696), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-09 06:07:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:49,043 INFO L93 Difference]: Finished difference Result 958 states and 1511 transitions. [2025-01-09 06:07:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:49,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 63 [2025-01-09 06:07:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:49,065 INFO L225 Difference]: With dead ends: 958 [2025-01-09 06:07:49,065 INFO L226 Difference]: Without dead ends: 483 [2025-01-09 06:07:49,071 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-01-09 06:07:49,078 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 152 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1351 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-01-09 06:07:49,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1351 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-01-09 06:07:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-01-09 06:07:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 426 states have (on average 1.5586854460093897) internal successors, (664), 430 states have internal predecessors, (664), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 06:07:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 746 transitions. [2025-01-09 06:07:49,166 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 746 transitions. Word has length 63 [2025-01-09 06:07:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:49,169 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 746 transitions. [2025-01-09 06:07:49,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-01-09 06:07:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 746 transitions. [2025-01-09 06:07:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:49,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:49,175 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-01-09 06:07:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:07:49,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:49,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 57218519, now seen corresponding path program 1 times [2025-01-09 06:07:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:49,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699159415] [2025-01-09 06:07:49,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:49,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:49,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:49,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699159415] [2025-01-09 06:07:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699159415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947743456] [2025-01-09 06:07:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:49,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:49,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:49,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:49,479 INFO L87 Difference]: Start difference. First operand 483 states and 746 transitions. 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-01-09 06:07:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:50,487 INFO L93 Difference]: Finished difference Result 698 states and 1059 transitions. [2025-01-09 06:07:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:50,487 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-01-09 06:07:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:50,493 INFO L225 Difference]: With dead ends: 698 [2025-01-09 06:07:50,493 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 06:07:50,494 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-01-09 06:07:50,497 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 510 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:50,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1536 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:07:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 06:07:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 591. [2025-01-09 06:07:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 512 states have (on average 1.53515625) internal successors, (786), 518 states have internal predecessors, (786), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2025-01-09 06:07:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 899 transitions. [2025-01-09 06:07:50,555 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 899 transitions. Word has length 63 [2025-01-09 06:07:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:50,555 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 899 transitions. [2025-01-09 06:07:50,555 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-01-09 06:07:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 899 transitions. [2025-01-09 06:07:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:50,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:50,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] [2025-01-09 06:07:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:07:50,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2065667223, now seen corresponding path program 1 times [2025-01-09 06:07:50,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525969276] [2025-01-09 06:07:50,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:50,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:50,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:50,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:50,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525969276] [2025-01-09 06:07:50,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525969276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:50,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:50,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117720206] [2025-01-09 06:07:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:50,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:50,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:50,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:50,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:50,811 INFO L87 Difference]: Start difference. First operand 591 states and 899 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-01-09 06:07:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:51,968 INFO L93 Difference]: Finished difference Result 946 states and 1401 transitions. [2025-01-09 06:07:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:51,969 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-01-09 06:07:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:51,977 INFO L225 Difference]: With dead ends: 946 [2025-01-09 06:07:51,978 INFO L226 Difference]: Without dead ends: 745 [2025-01-09 06:07:51,978 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-01-09 06:07:51,979 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1085 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:51,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1814 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 06:07:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-01-09 06:07:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 699. [2025-01-09 06:07:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 598 states have (on average 1.5167224080267558) internal successors, (907), 606 states have internal predecessors, (907), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2025-01-09 06:07:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1054 transitions. [2025-01-09 06:07:52,052 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1054 transitions. Word has length 63 [2025-01-09 06:07:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1054 transitions. [2025-01-09 06:07:52,053 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-01-09 06:07:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1054 transitions. [2025-01-09 06:07:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:52,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:52,058 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-01-09 06:07:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:07:52,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:52,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2050148505, now seen corresponding path program 1 times [2025-01-09 06:07:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986546054] [2025-01-09 06:07:52,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:52,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:52,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:52,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:52,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:52,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986546054] [2025-01-09 06:07:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986546054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908971504] [2025-01-09 06:07:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:52,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:52,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:52,168 INFO L87 Difference]: Start difference. First operand 699 states and 1054 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:52,470 INFO L93 Difference]: Finished difference Result 1569 states and 2300 transitions. [2025-01-09 06:07:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 06:07:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:52,478 INFO L225 Difference]: With dead ends: 1569 [2025-01-09 06:07:52,478 INFO L226 Difference]: Without dead ends: 1266 [2025-01-09 06:07:52,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:52,481 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 839 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:52,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1639 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:07:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-01-09 06:07:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1249. [2025-01-09 06:07:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1038 states have (on average 1.4595375722543353) internal successors, (1515), 1054 states have internal predecessors, (1515), 128 states have call successors, (128), 70 states have call predecessors, (128), 81 states have return successors, (164), 128 states have call predecessors, (164), 126 states have call successors, (164) [2025-01-09 06:07:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1807 transitions. [2025-01-09 06:07:52,600 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1807 transitions. Word has length 63 [2025-01-09 06:07:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:52,601 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1807 transitions. [2025-01-09 06:07:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1807 transitions. [2025-01-09 06:07:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:07:52,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:52,604 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-01-09 06:07:52,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:07:52,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:52,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:52,605 INFO L85 PathProgramCache]: Analyzing trace with hash 717739370, now seen corresponding path program 1 times [2025-01-09 06:07:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:52,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44638906] [2025-01-09 06:07:52,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:52,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:07:52,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:07:52,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:52,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:52,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:52,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44638906] [2025-01-09 06:07:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44638906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:52,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999028391] [2025-01-09 06:07:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:52,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:52,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:52,723 INFO L87 Difference]: Start difference. First operand 1249 states and 1807 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-01-09 06:07:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:52,845 INFO L93 Difference]: Finished difference Result 2122 states and 3041 transitions. [2025-01-09 06:07:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:52,846 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-01-09 06:07:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:52,857 INFO L225 Difference]: With dead ends: 2122 [2025-01-09 06:07:52,857 INFO L226 Difference]: Without dead ends: 1269 [2025-01-09 06:07:52,860 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-01-09 06:07:52,860 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 0 mSDsluCounter, 2966 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3709 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-01-09 06:07:52,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3709 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-01-09 06:07:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1269. [2025-01-09 06:07:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1054 states have (on average 1.4478178368121442) internal successors, (1526), 1070 states have internal predecessors, (1526), 128 states have call successors, (128), 70 states have call predecessors, (128), 85 states have return successors, (171), 132 states have call predecessors, (171), 126 states have call successors, (171) [2025-01-09 06:07:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1825 transitions. [2025-01-09 06:07:52,938 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1825 transitions. Word has length 64 [2025-01-09 06:07:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:52,938 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1825 transitions. [2025-01-09 06:07:52,939 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-01-09 06:07:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1825 transitions. [2025-01-09 06:07:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:07:52,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:52,940 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-01-09 06:07:52,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:07:52,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:52,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:52,941 INFO L85 PathProgramCache]: Analyzing trace with hash 323372584, now seen corresponding path program 1 times [2025-01-09 06:07:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555969646] [2025-01-09 06:07:52,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:52,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:52,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:07:52,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:07:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555969646] [2025-01-09 06:07:53,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555969646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:53,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:53,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:53,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868641313] [2025-01-09 06:07:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:53,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:53,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:53,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:53,016 INFO L87 Difference]: Start difference. First operand 1269 states and 1825 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:53,740 INFO L93 Difference]: Finished difference Result 3731 states and 5262 transitions. [2025-01-09 06:07:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:07:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-01-09 06:07:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:53,751 INFO L225 Difference]: With dead ends: 3731 [2025-01-09 06:07:53,751 INFO L226 Difference]: Without dead ends: 1559 [2025-01-09 06:07:53,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:53,757 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 1963 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:53,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 2833 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-01-09 06:07:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1194. [2025-01-09 06:07:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 979 states have (on average 1.421859039836568) internal successors, (1392), 995 states have internal predecessors, (1392), 128 states have call successors, (128), 70 states have call predecessors, (128), 85 states have return successors, (159), 132 states have call predecessors, (159), 126 states have call successors, (159) [2025-01-09 06:07:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1679 transitions. [2025-01-09 06:07:53,843 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1679 transitions. Word has length 64 [2025-01-09 06:07:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:53,843 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1679 transitions. [2025-01-09 06:07:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1679 transitions. [2025-01-09 06:07:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:53,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:53,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:53,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:07:53,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:53,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1765156940, now seen corresponding path program 1 times [2025-01-09 06:07:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916582799] [2025-01-09 06:07:53,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:53,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:53,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:53,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:53,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:53,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:53,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916582799] [2025-01-09 06:07:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916582799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:53,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:53,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127846677] [2025-01-09 06:07:53,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:53,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:53,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:53,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:53,946 INFO L87 Difference]: Start difference. First operand 1194 states and 1679 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-01-09 06:07:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:54,024 INFO L93 Difference]: Finished difference Result 2037 states and 2806 transitions. [2025-01-09 06:07:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2025-01-09 06:07:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:54,031 INFO L225 Difference]: With dead ends: 2037 [2025-01-09 06:07:54,031 INFO L226 Difference]: Without dead ends: 1239 [2025-01-09 06:07:54,033 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-01-09 06:07:54,034 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 0 mSDsluCounter, 2935 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3670 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-01-09 06:07:54,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3670 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-01-09 06:07:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2025-01-09 06:07:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1015 states have (on average 1.4068965517241379) internal successors, (1428), 1031 states have internal predecessors, (1428), 128 states have call successors, (128), 70 states have call predecessors, (128), 94 states have return successors, (168), 141 states have call predecessors, (168), 126 states have call successors, (168) [2025-01-09 06:07:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1724 transitions. [2025-01-09 06:07:54,120 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1724 transitions. Word has length 65 [2025-01-09 06:07:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:54,120 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1724 transitions. [2025-01-09 06:07:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-01-09 06:07:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1724 transitions. [2025-01-09 06:07:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:54,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:54,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:54,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:07:54,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:54,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash 158071094, now seen corresponding path program 1 times [2025-01-09 06:07:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536487190] [2025-01-09 06:07:54,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:54,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:54,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:54,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:54,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:54,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:54,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536487190] [2025-01-09 06:07:54,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536487190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:54,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:54,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:54,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970852358] [2025-01-09 06:07:54,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:54,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:54,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:54,307 INFO L87 Difference]: Start difference. First operand 1239 states and 1724 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:55,394 INFO L93 Difference]: Finished difference Result 2136 states and 2874 transitions. [2025-01-09 06:07:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:07:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-01-09 06:07:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:55,405 INFO L225 Difference]: With dead ends: 2136 [2025-01-09 06:07:55,405 INFO L226 Difference]: Without dead ends: 1378 [2025-01-09 06:07:55,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:07:55,409 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1085 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:55,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1535 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:07:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-01-09 06:07:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1248. [2025-01-09 06:07:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1024 states have (on average 1.4013671875) internal successors, (1435), 1038 states have internal predecessors, (1435), 129 states have call successors, (129), 71 states have call predecessors, (129), 93 states have return successors, (163), 142 states have call predecessors, (163), 127 states have call successors, (163) [2025-01-09 06:07:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1727 transitions. [2025-01-09 06:07:55,538 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1727 transitions. Word has length 65 [2025-01-09 06:07:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:55,538 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1727 transitions. [2025-01-09 06:07:55,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1727 transitions. [2025-01-09 06:07:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:55,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:55,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:55,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:07:55,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash 376925812, now seen corresponding path program 1 times [2025-01-09 06:07:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910977535] [2025-01-09 06:07:55,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:55,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:55,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:55,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:55,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910977535] [2025-01-09 06:07:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910977535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:55,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:55,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:55,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036714720] [2025-01-09 06:07:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:55,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:55,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:55,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:55,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:55,623 INFO L87 Difference]: Start difference. First operand 1248 states and 1727 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:56,352 INFO L93 Difference]: Finished difference Result 2938 states and 3958 transitions. [2025-01-09 06:07:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:07:56,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-01-09 06:07:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:56,367 INFO L225 Difference]: With dead ends: 2938 [2025-01-09 06:07:56,367 INFO L226 Difference]: Without dead ends: 2089 [2025-01-09 06:07:56,371 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-01-09 06:07:56,374 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1040 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:56,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 780 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-01-09 06:07:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2079. [2025-01-09 06:07:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 1660 states have (on average 1.3475903614457831) internal successors, (2237), 1687 states have internal predecessors, (2237), 233 states have call successors, (233), 135 states have call predecessors, (233), 184 states have return successors, (340), 263 states have call predecessors, (340), 231 states have call successors, (340) [2025-01-09 06:07:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2810 transitions. [2025-01-09 06:07:56,561 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2810 transitions. Word has length 65 [2025-01-09 06:07:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:56,561 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 2810 transitions. [2025-01-09 06:07:56,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2810 transitions. [2025-01-09 06:07:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:07:56,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:56,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:56,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:07:56,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:56,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 653572465, now seen corresponding path program 1 times [2025-01-09 06:07:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316673328] [2025-01-09 06:07:56,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:56,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:07:56,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:07:56,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:56,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316673328] [2025-01-09 06:07:56,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316673328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:56,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:56,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016682986] [2025-01-09 06:07:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:56,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:56,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:56,614 INFO L87 Difference]: Start difference. First operand 2079 states and 2810 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:56,728 INFO L93 Difference]: Finished difference Result 3623 states and 4898 transitions. [2025-01-09 06:07:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:56,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-01-09 06:07:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:56,734 INFO L225 Difference]: With dead ends: 3623 [2025-01-09 06:07:56,734 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 06:07:56,742 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-01-09 06:07:56,743 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 705 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:56,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 722 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 06:07:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-01-09 06:07:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 343 states have (on average 1.5801749271137027) internal successors, (542), 344 states have internal predecessors, (542), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 06:07:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 594 transitions. [2025-01-09 06:07:56,762 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 594 transitions. Word has length 66 [2025-01-09 06:07:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:56,764 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 594 transitions. [2025-01-09 06:07:56,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 594 transitions. [2025-01-09 06:07:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:07:56,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:56,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:07:56,768 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1631353378, now seen corresponding path program 1 times [2025-01-09 06:07:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148878976] [2025-01-09 06:07:56,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:56,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:07:56,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:07:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148878976] [2025-01-09 06:07:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148878976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:56,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260762912] [2025-01-09 06:07:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:56,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:56,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:56,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:56,840 INFO L87 Difference]: Start difference. First operand 376 states and 594 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:56,859 INFO L93 Difference]: Finished difference Result 741 states and 1171 transitions. [2025-01-09 06:07:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:56,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 176 [2025-01-09 06:07:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:56,863 INFO L225 Difference]: With dead ends: 741 [2025-01-09 06:07:56,864 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 06:07:56,865 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-01-09 06:07:56,865 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 583 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 593 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-01-09 06:07:56,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 593 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 06:07:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-01-09 06:07:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 343 states have (on average 1.5772594752186588) internal successors, (541), 344 states have internal predecessors, (541), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 06:07:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 593 transitions. [2025-01-09 06:07:56,883 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 593 transitions. Word has length 176 [2025-01-09 06:07:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:56,883 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 593 transitions. [2025-01-09 06:07:56,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 593 transitions. [2025-01-09 06:07:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:07:56,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:56,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:56,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:07:56,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:56,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash 93254944, now seen corresponding path program 1 times [2025-01-09 06:07:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:56,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809688778] [2025-01-09 06:07:56,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:56,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:07:56,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:07:56,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:56,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:56,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:56,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809688778] [2025-01-09 06:07:56,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809688778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:56,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:56,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336949774] [2025-01-09 06:07:56,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:56,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:56,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:56,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:56,969 INFO L87 Difference]: Start difference. First operand 376 states and 593 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:56,989 INFO L93 Difference]: Finished difference Result 733 states and 1154 transitions. [2025-01-09 06:07:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 176 [2025-01-09 06:07:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:56,994 INFO L225 Difference]: With dead ends: 733 [2025-01-09 06:07:56,994 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 06:07:56,995 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-01-09 06:07:56,996 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 574 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 592 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-01-09 06:07:56,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 592 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 06:07:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-01-09 06:07:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 343 states have (on average 1.5743440233236152) internal successors, (540), 344 states have internal predecessors, (540), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 06:07:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 592 transitions. [2025-01-09 06:07:57,014 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 592 transitions. Word has length 176 [2025-01-09 06:07:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:57,014 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 592 transitions. [2025-01-09 06:07:57,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 592 transitions. [2025-01-09 06:07:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:07:57,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:57,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:57,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:07:57,017 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:57,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash -887699870, now seen corresponding path program 1 times [2025-01-09 06:07:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:57,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118435502] [2025-01-09 06:07:57,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:57,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:07:57,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:07:57,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:57,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118435502] [2025-01-09 06:07:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118435502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624896934] [2025-01-09 06:07:57,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:57,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:57,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:57,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:57,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:57,187 INFO L87 Difference]: Start difference. First operand 376 states and 592 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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-01-09 06:07:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:57,795 INFO L93 Difference]: Finished difference Result 1134 states and 1806 transitions. [2025-01-09 06:07:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 176 [2025-01-09 06:07:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:57,802 INFO L225 Difference]: With dead ends: 1134 [2025-01-09 06:07:57,802 INFO L226 Difference]: Without dead ends: 779 [2025-01-09 06:07:57,804 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-01-09 06:07:57,805 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1148 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:57,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1631 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-01-09 06:07:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 750. [2025-01-09 06:07:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 689 states have (on average 1.5878084179970973) internal successors, (1094), 691 states have internal predecessors, (1094), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-01-09 06:07:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1189 transitions. [2025-01-09 06:07:57,839 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1189 transitions. Word has length 176 [2025-01-09 06:07:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1189 transitions. [2025-01-09 06:07:57,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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-01-09 06:07:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1189 transitions. [2025-01-09 06:07:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:07:57,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:57,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:57,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:07:57,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1104682470, now seen corresponding path program 1 times [2025-01-09 06:07:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234356856] [2025-01-09 06:07:57,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:57,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:07:57,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:07:57,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:57,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234356856] [2025-01-09 06:07:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234356856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742159806] [2025-01-09 06:07:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:58,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:58,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:58,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:58,040 INFO L87 Difference]: Start difference. First operand 750 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:07:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:58,839 INFO L93 Difference]: Finished difference Result 1954 states and 3135 transitions. [2025-01-09 06:07:58,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:58,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:07:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:58,847 INFO L225 Difference]: With dead ends: 1954 [2025-01-09 06:07:58,847 INFO L226 Difference]: Without dead ends: 1225 [2025-01-09 06:07:58,850 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-01-09 06:07:58,850 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 1184 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:58,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 2323 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:07:58,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-01-09 06:07:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1096. [2025-01-09 06:07:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1007 states have (on average 1.5809334657398213) internal successors, (1592), 1010 states have internal predecessors, (1592), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-01-09 06:07:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1732 transitions. [2025-01-09 06:07:58,901 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1732 transitions. Word has length 176 [2025-01-09 06:07:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:58,903 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1732 transitions. [2025-01-09 06:07:58,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:07:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1732 transitions. [2025-01-09 06:07:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:07:58,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:58,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:58,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:07:58,906 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:58,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1743703960, now seen corresponding path program 1 times [2025-01-09 06:07:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959391430] [2025-01-09 06:07:58,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:58,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:07:58,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:07:58,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:58,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959391430] [2025-01-09 06:07:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959391430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:59,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:59,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975550343] [2025-01-09 06:07:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:59,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:59,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:59,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:59,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:59,104 INFO L87 Difference]: Start difference. First operand 1096 states and 1732 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:07:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:59,517 INFO L93 Difference]: Finished difference Result 2291 states and 3667 transitions. [2025-01-09 06:07:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:07:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:59,526 INFO L225 Difference]: With dead ends: 2291 [2025-01-09 06:07:59,527 INFO L226 Difference]: Without dead ends: 1216 [2025-01-09 06:07:59,531 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-01-09 06:07:59,533 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 808 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:59,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1177 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:07:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-09 06:07:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1096. [2025-01-09 06:07:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1007 states have (on average 1.5779543197616683) internal successors, (1589), 1010 states have internal predecessors, (1589), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-01-09 06:07:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1729 transitions. [2025-01-09 06:07:59,634 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1729 transitions. Word has length 176 [2025-01-09 06:07:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:59,635 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1729 transitions. [2025-01-09 06:07:59,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:07:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1729 transitions. [2025-01-09 06:07:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:07:59,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:59,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:59,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:07:59,637 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:59,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1628095910, now seen corresponding path program 1 times [2025-01-09 06:07:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:59,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854681167] [2025-01-09 06:07:59,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:59,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:59,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:07:59,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:07:59,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:59,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:59,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854681167] [2025-01-09 06:07:59,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854681167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:59,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:59,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140018249] [2025-01-09 06:07:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:59,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:59,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:59,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:59,824 INFO L87 Difference]: Start difference. First operand 1096 states and 1729 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:00,250 INFO L93 Difference]: Finished difference Result 2286 states and 3651 transitions. [2025-01-09 06:08:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:08:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:00,259 INFO L225 Difference]: With dead ends: 2286 [2025-01-09 06:08:00,259 INFO L226 Difference]: Without dead ends: 1211 [2025-01-09 06:08:00,262 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-01-09 06:08:00,263 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 805 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:00,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1169 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:08:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-01-09 06:08:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1096. [2025-01-09 06:08:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1007 states have (on average 1.5749751737835154) internal successors, (1586), 1010 states have internal predecessors, (1586), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-01-09 06:08:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1726 transitions. [2025-01-09 06:08:00,320 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1726 transitions. Word has length 176 [2025-01-09 06:08:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:00,321 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1726 transitions. [2025-01-09 06:08:00,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1726 transitions. [2025-01-09 06:08:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:00,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:00,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:00,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:08:00,324 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:00,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2013958312, now seen corresponding path program 1 times [2025-01-09 06:08:00,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:00,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040197604] [2025-01-09 06:08:00,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:00,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:00,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:00,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:00,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040197604] [2025-01-09 06:08:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040197604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:08:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870953932] [2025-01-09 06:08:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:00,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:08:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:00,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:08:00,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:08:00,537 INFO L87 Difference]: Start difference. First operand 1096 states and 1726 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:01,415 INFO L93 Difference]: Finished difference Result 3043 states and 4847 transitions. [2025-01-09 06:08:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:01,427 INFO L225 Difference]: With dead ends: 3043 [2025-01-09 06:08:01,427 INFO L226 Difference]: Without dead ends: 1968 [2025-01-09 06:08:01,432 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-01-09 06:08:01,432 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 1134 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:01,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 3082 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:08:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2025-01-09 06:08:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1829. [2025-01-09 06:08:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1682 states have (on average 1.5772889417360285) internal successors, (2653), 1689 states have internal predecessors, (2653), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-01-09 06:08:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2889 transitions. [2025-01-09 06:08:01,537 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2889 transitions. Word has length 176 [2025-01-09 06:08:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:01,538 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2889 transitions. [2025-01-09 06:08:01,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2889 transitions. [2025-01-09 06:08:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:01,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:01,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:01,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:08:01,540 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:01,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1749310822, now seen corresponding path program 1 times [2025-01-09 06:08:01,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514453604] [2025-01-09 06:08:01,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:01,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:01,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:01,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:01,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514453604] [2025-01-09 06:08:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514453604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:08:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748648375] [2025-01-09 06:08:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:08:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:01,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:08:01,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:08:01,711 INFO L87 Difference]: Start difference. First operand 1829 states and 2889 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:02,158 INFO L93 Difference]: Finished difference Result 3868 states and 6201 transitions. [2025-01-09 06:08:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:08:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:02,170 INFO L225 Difference]: With dead ends: 3868 [2025-01-09 06:08:02,170 INFO L226 Difference]: Without dead ends: 2060 [2025-01-09 06:08:02,176 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-01-09 06:08:02,176 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 801 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:02,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1155 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:08:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2025-01-09 06:08:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1829. [2025-01-09 06:08:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1682 states have (on average 1.5743162901307968) internal successors, (2648), 1689 states have internal predecessors, (2648), 110 states have call successors, (110), 30 states have call predecessors, (110), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-01-09 06:08:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2884 transitions. [2025-01-09 06:08:02,277 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2884 transitions. Word has length 176 [2025-01-09 06:08:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:02,277 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2884 transitions. [2025-01-09 06:08:02,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2884 transitions. [2025-01-09 06:08:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:02,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:02,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:02,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:08:02,281 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:02,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash -614530840, now seen corresponding path program 1 times [2025-01-09 06:08:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062231541] [2025-01-09 06:08:02,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:02,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:02,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:02,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:02,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062231541] [2025-01-09 06:08:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062231541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:02,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:08:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510845722] [2025-01-09 06:08:02,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:02,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:08:02,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:02,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:08:02,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:08:02,451 INFO L87 Difference]: Start difference. First operand 1829 states and 2884 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:03,399 INFO L93 Difference]: Finished difference Result 5386 states and 8613 transitions. [2025-01-09 06:08:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:03,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:03,419 INFO L225 Difference]: With dead ends: 5386 [2025-01-09 06:08:03,420 INFO L226 Difference]: Without dead ends: 3578 [2025-01-09 06:08:03,427 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-01-09 06:08:03,427 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 1121 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:03,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 3051 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:08:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-01-09 06:08:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3409. [2025-01-09 06:08:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3140 states have (on average 1.5878980891719745) internal successors, (4986), 3161 states have internal predecessors, (4986), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-01-09 06:08:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 5438 transitions. [2025-01-09 06:08:03,667 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 5438 transitions. Word has length 176 [2025-01-09 06:08:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:03,668 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 5438 transitions. [2025-01-09 06:08:03,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 5438 transitions. [2025-01-09 06:08:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:03,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:03,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:03,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:08:03,673 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:03,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1937709786, now seen corresponding path program 1 times [2025-01-09 06:08:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019830016] [2025-01-09 06:08:03,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:03,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:03,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:03,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:03,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:03,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019830016] [2025-01-09 06:08:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019830016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:08:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713106148] [2025-01-09 06:08:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:03,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:08:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:03,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:08:03,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:08:03,835 INFO L87 Difference]: Start difference. First operand 3409 states and 5438 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:04,369 INFO L93 Difference]: Finished difference Result 7348 states and 11941 transitions. [2025-01-09 06:08:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:08:04,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:04,398 INFO L225 Difference]: With dead ends: 7348 [2025-01-09 06:08:04,398 INFO L226 Difference]: Without dead ends: 3960 [2025-01-09 06:08:04,411 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-01-09 06:08:04,413 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 797 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:04,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1141 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:08:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2025-01-09 06:08:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 3409. [2025-01-09 06:08:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3140 states have (on average 1.5850318471337579) internal successors, (4977), 3161 states have internal predecessors, (4977), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-01-09 06:08:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 5429 transitions. [2025-01-09 06:08:04,632 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 5429 transitions. Word has length 176 [2025-01-09 06:08:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:04,632 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 5429 transitions. [2025-01-09 06:08:04,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 5429 transitions. [2025-01-09 06:08:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:04,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:04,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:04,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:08:04,636 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:04,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash -40730328, now seen corresponding path program 1 times [2025-01-09 06:08:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590203134] [2025-01-09 06:08:04,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:04,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:04,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:04,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:04,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:04,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:04,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590203134] [2025-01-09 06:08:04,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590203134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:08:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925024641] [2025-01-09 06:08:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:04,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:08:04,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:04,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:08:04,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:08:04,747 INFO L87 Difference]: Start difference. First operand 3409 states and 5429 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:05,221 INFO L93 Difference]: Finished difference Result 7290 states and 11807 transitions. [2025-01-09 06:08:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:08:05,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:05,240 INFO L225 Difference]: With dead ends: 7290 [2025-01-09 06:08:05,240 INFO L226 Difference]: Without dead ends: 3902 [2025-01-09 06:08:05,251 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-01-09 06:08:05,251 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 824 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:05,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1061 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:08:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2025-01-09 06:08:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3409. [2025-01-09 06:08:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3140 states have (on average 1.5821656050955415) internal successors, (4968), 3161 states have internal predecessors, (4968), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-01-09 06:08:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 5420 transitions. [2025-01-09 06:08:05,461 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 5420 transitions. Word has length 176 [2025-01-09 06:08:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:05,461 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 5420 transitions. [2025-01-09 06:08:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 5420 transitions. [2025-01-09 06:08:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:05,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:05,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:05,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:08:05,465 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 385824170, now seen corresponding path program 1 times [2025-01-09 06:08:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536529940] [2025-01-09 06:08:05,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:05,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:05,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:05,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:05,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536529940] [2025-01-09 06:08:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536529940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:08:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726940187] [2025-01-09 06:08:05,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:05,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:08:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:05,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:08:05,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:08:05,604 INFO L87 Difference]: Start difference. First operand 3409 states and 5420 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:06,105 INFO L93 Difference]: Finished difference Result 7261 states and 11731 transitions. [2025-01-09 06:08:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:08:06,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:06,123 INFO L225 Difference]: With dead ends: 7261 [2025-01-09 06:08:06,124 INFO L226 Difference]: Without dead ends: 3873 [2025-01-09 06:08:06,134 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-01-09 06:08:06,135 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 790 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:06,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1119 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:08:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2025-01-09 06:08:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 3409. [2025-01-09 06:08:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3140 states have (on average 1.5792993630573249) internal successors, (4959), 3161 states have internal predecessors, (4959), 194 states have call successors, (194), 54 states have call predecessors, (194), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-01-09 06:08:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 5411 transitions. [2025-01-09 06:08:06,318 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 5411 transitions. Word has length 176 [2025-01-09 06:08:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:06,319 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 5411 transitions. [2025-01-09 06:08:06,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 5411 transitions. [2025-01-09 06:08:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:06,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:06,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:06,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:08:06,323 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:06,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash -154605336, now seen corresponding path program 1 times [2025-01-09 06:08:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:06,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332428395] [2025-01-09 06:08:06,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:06,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:06,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:06,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:06,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:06,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:06,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332428395] [2025-01-09 06:08:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332428395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:06,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:08:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047391867] [2025-01-09 06:08:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:06,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:08:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:06,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:08:06,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:08:06,479 INFO L87 Difference]: Start difference. First operand 3409 states and 5411 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:07,750 INFO L93 Difference]: Finished difference Result 10376 states and 16732 transitions. [2025-01-09 06:08:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:07,786 INFO L225 Difference]: With dead ends: 10376 [2025-01-09 06:08:07,787 INFO L226 Difference]: Without dead ends: 6988 [2025-01-09 06:08:07,799 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-01-09 06:08:07,800 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 1089 mSDsluCounter, 2242 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:07,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 2968 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:08:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2025-01-09 06:08:08,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 6794. [2025-01-09 06:08:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6794 states, 6263 states have (on average 1.5971579115439885) internal successors, (10003), 6330 states have internal predecessors, (10003), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-01-09 06:08:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6794 states to 6794 states and 10983 transitions. [2025-01-09 06:08:08,215 INFO L78 Accepts]: Start accepts. Automaton has 6794 states and 10983 transitions. Word has length 176 [2025-01-09 06:08:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:08,216 INFO L471 AbstractCegarLoop]: Abstraction has 6794 states and 10983 transitions. [2025-01-09 06:08:08,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6794 states and 10983 transitions. [2025-01-09 06:08:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:08,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:08,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:08,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:08:08,222 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash -310585878, now seen corresponding path program 1 times [2025-01-09 06:08:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096579097] [2025-01-09 06:08:08,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:08,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:08,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:08,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:08,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:08,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:08,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096579097] [2025-01-09 06:08:08,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096579097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:08,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:08,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:08:08,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134249483] [2025-01-09 06:08:08,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:08,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:08:08,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:08,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:08:08,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:08:08,348 INFO L87 Difference]: Start difference. First operand 6794 states and 10983 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:09,071 INFO L93 Difference]: Finished difference Result 14729 states and 24299 transitions. [2025-01-09 06:08:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:08:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:09,110 INFO L225 Difference]: With dead ends: 14729 [2025-01-09 06:08:09,110 INFO L226 Difference]: Without dead ends: 7956 [2025-01-09 06:08:09,131 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-01-09 06:08:09,132 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 784 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:09,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1103 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:08:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7956 states. [2025-01-09 06:08:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7956 to 6794. [2025-01-09 06:08:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6794 states, 6263 states have (on average 1.5944435574006068) internal successors, (9986), 6330 states have internal predecessors, (9986), 362 states have call successors, (362), 102 states have call predecessors, (362), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-01-09 06:08:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6794 states to 6794 states and 10966 transitions. [2025-01-09 06:08:09,557 INFO L78 Accepts]: Start accepts. Automaton has 6794 states and 10966 transitions. Word has length 176 [2025-01-09 06:08:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:09,558 INFO L471 AbstractCegarLoop]: Abstraction has 6794 states and 10966 transitions. [2025-01-09 06:08:09,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6794 states and 10966 transitions. [2025-01-09 06:08:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:09,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:09,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:09,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:08:09,564 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:09,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 100024488, now seen corresponding path program 1 times [2025-01-09 06:08:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263156440] [2025-01-09 06:08:09,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:09,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:09,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:09,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:09,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263156440] [2025-01-09 06:08:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263156440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:09,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:09,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:08:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14837176] [2025-01-09 06:08:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:09,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:08:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:09,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:08:09,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:08:09,704 INFO L87 Difference]: Start difference. First operand 6794 states and 10966 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:11,460 INFO L93 Difference]: Finished difference Result 22557 states and 37088 transitions. [2025-01-09 06:08:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:11,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:11,549 INFO L225 Difference]: With dead ends: 22557 [2025-01-09 06:08:11,549 INFO L226 Difference]: Without dead ends: 15784 [2025-01-09 06:08:11,575 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-01-09 06:08:11,575 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1419 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:11,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 2920 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:08:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15784 states. [2025-01-09 06:08:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15784 to 14100. [2025-01-09 06:08:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14100 states, 13007 states have (on average 1.6175905281771354) internal successors, (21040), 13220 states have internal predecessors, (21040), 682 states have call successors, (682), 198 states have call predecessors, (682), 410 states have return successors, (1706), 713 states have call predecessors, (1706), 682 states have call successors, (1706) [2025-01-09 06:08:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14100 states to 14100 states and 23428 transitions. [2025-01-09 06:08:12,366 INFO L78 Accepts]: Start accepts. Automaton has 14100 states and 23428 transitions. Word has length 176 [2025-01-09 06:08:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:12,366 INFO L471 AbstractCegarLoop]: Abstraction has 14100 states and 23428 transitions. [2025-01-09 06:08:12,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14100 states and 23428 transitions. [2025-01-09 06:08:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:12,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:12,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:12,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:08:12,374 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1687845334, now seen corresponding path program 1 times [2025-01-09 06:08:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602372222] [2025-01-09 06:08:12,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:12,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:12,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:12,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:12,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602372222] [2025-01-09 06:08:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602372222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:12,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:12,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:08:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865009149] [2025-01-09 06:08:12,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:08:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:12,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:08:12,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:08:12,507 INFO L87 Difference]: Start difference. First operand 14100 states and 23428 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:14,859 INFO L93 Difference]: Finished difference Result 47615 states and 81292 transitions. [2025-01-09 06:08:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:14,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:15,018 INFO L225 Difference]: With dead ends: 47615 [2025-01-09 06:08:15,018 INFO L226 Difference]: Without dead ends: 33536 [2025-01-09 06:08:15,060 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-01-09 06:08:15,061 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1174 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:15,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 2912 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:08:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33536 states. [2025-01-09 06:08:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33536 to 30591. [2025-01-09 06:08:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30591 states, 28228 states have (on average 1.6456001133626186) internal successors, (46452), 28895 states have internal predecessors, (46452), 1306 states have call successors, (1306), 390 states have call predecessors, (1306), 1056 states have return successors, (5402), 1369 states have call predecessors, (5402), 1306 states have call successors, (5402) [2025-01-09 06:08:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30591 states to 30591 states and 53160 transitions. [2025-01-09 06:08:17,026 INFO L78 Accepts]: Start accepts. Automaton has 30591 states and 53160 transitions. Word has length 176 [2025-01-09 06:08:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:17,027 INFO L471 AbstractCegarLoop]: Abstraction has 30591 states and 53160 transitions. [2025-01-09 06:08:17,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30591 states and 53160 transitions. [2025-01-09 06:08:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:17,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:17,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:17,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:08:17,039 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:17,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash 471238760, now seen corresponding path program 1 times [2025-01-09 06:08:17,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:17,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930203440] [2025-01-09 06:08:17,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:17,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:17,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:17,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:17,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930203440] [2025-01-09 06:08:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930203440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:08:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190346037] [2025-01-09 06:08:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:08:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:17,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:08:17,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:08:17,166 INFO L87 Difference]: Start difference. First operand 30591 states and 53160 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:21,405 INFO L93 Difference]: Finished difference Result 104460 states and 189038 transitions. [2025-01-09 06:08:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:21,745 INFO L225 Difference]: With dead ends: 104460 [2025-01-09 06:08:21,745 INFO L226 Difference]: Without dead ends: 73890 [2025-01-09 06:08:21,850 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-01-09 06:08:21,851 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1350 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:21,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 2900 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:08:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73890 states. [2025-01-09 06:08:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73890 to 68580. [2025-01-09 06:08:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68580 states, 63223 states have (on average 1.6754662069183683) internal successors, (105928), 65284 states have internal predecessors, (105928), 2522 states have call successors, (2522), 774 states have call predecessors, (2522), 2834 states have return successors, (18906), 2649 states have call predecessors, (18906), 2522 states have call successors, (18906) [2025-01-09 06:08:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68580 states to 68580 states and 127356 transitions. [2025-01-09 06:08:26,379 INFO L78 Accepts]: Start accepts. Automaton has 68580 states and 127356 transitions. Word has length 176 [2025-01-09 06:08:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:08:26,380 INFO L471 AbstractCegarLoop]: Abstraction has 68580 states and 127356 transitions. [2025-01-09 06:08:26,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 68580 states and 127356 transitions. [2025-01-09 06:08:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:08:26,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:08:26,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:08:26,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:08:26,402 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:08:26,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:08:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash 540886634, now seen corresponding path program 1 times [2025-01-09 06:08:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:08:26,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075488880] [2025-01-09 06:08:26,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:08:26,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:08:26,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:08:26,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:08:26,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:08:26,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:08:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:08:26,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:08:26,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075488880] [2025-01-09 06:08:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075488880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:08:26,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:08:26,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:08:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267744319] [2025-01-09 06:08:26,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:08:26,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:08:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:08:26,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:08:26,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:08:26,565 INFO L87 Difference]: Start difference. First operand 68580 states and 127356 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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-01-09 06:08:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:08:34,862 INFO L93 Difference]: Finished difference Result 233093 states and 460136 transitions. [2025-01-09 06:08:34,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:08:34,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:08:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:08:35,752 INFO L225 Difference]: With dead ends: 233093 [2025-01-09 06:08:35,752 INFO L226 Difference]: Without dead ends: 164534 [2025-01-09 06:08:35,970 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-01-09 06:08:35,971 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1175 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:08:35,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 2055 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:08:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164534 states.